Cone Constraints Research Articles

Global embedding of fiber inflation in a perturbative large volume scenario

We present a global embedding of the fiber inflation model in a perturbative large volume scenario (LVS) in which the inflationary potential is induced via a combination of string-loop corrections and higher derivative F4 effects. The minimal fiber inflation model developed in the standard LVS generically faces some strong bounds on the inflaton field range arising from the Kähler cone constraints, which subsequently creates a challenge for realizing the cosmological observables while consistently respecting the underlying supergravity approximations. The main attractive feature of this proposal is to naturally alleviate this issue by embedding fiber inflation in perturbative LVS. Published by the American Physical Society 2024

An MPC-DCM Control Method for a Forward-Bending Biped Robot Based on Force and Moment Control

For a forward-bending biped robot with 10 degrees of freedom on its legs, a new control framework of MPC-DCM based on force and moment is proposed in this paper. Specifically, the Diverging Component of Motion (DCM) is a stability criterion for biped robots based on linear inverted pendulum, and Model Predictive Control (MPC) is an optimization solution strategy using rolling optimization. In this paper, DCM theory is applied to the state transition matrix of the system, combined with simplified rigid body dynamics, the mathematical description of the biped robot system is established, the classical MPC method is used to optimize the control input, and DCM constraints are added to the constraints of MPC, making the real-time DCM approximate to a straight line in the walking single gait. At the same time, the linear angle and friction cone constraints are considered to enhance the stability of the robot during walking. In this paper, MATLAB/Simulink is used to simulate the robot. Under the control of this algorithm, the robot can reach a walking speed of 0.75 m/s and has a certain anti-disturbance ability and ground adaptability. In this paper, the Model-H16 robot is used to deploy the physical algorithm, and the linear walking and obstacle walking of the physical robot are realized.

Finding the optimal probe state for multiparameter quantum metrology using conic programming

The ultimate precision in quantum sensing could be achieved using optimal quantum probe states. However, current quantum sensing protocols do not use probe states optimally. Indeed, the calculation of optimal probe states remains an outstanding challenge. Here, we present an algorithm that efficiently calculates a probe state for correlated and uncorrelated measurement strategies. The algorithm involves a conic program, which minimizes a linear objective function subject to conic constraints on a operator-valued variable. Our algorithm outputs a probe state that is a simple function of the optimal variable. We prove that our algorithm finds the optimal probe state for channel estimation problems, even in the multiparameter setting. For many noiseless quantum sensing problems, we prove the optimality of maximally entangled probe states. We also analyze the performance of 3D-field sensing using various probe states. Our work opens the door for a plethora of applications in quantum metrology.

Transmission design for ISAC‐WPT backscatter RFID systems

AbstractIn this letter, a novel integrated sensing and communication (ISAC) scenario with wireless power transfer (ISAC‐WPT) is investigated. In this new setup, an access point simultaneously employs communication and sensing beams to serve a communication user, detect an RFID tag, and power an energy receiver. The objective is to design the sensing and communication beams to minimize the total transmit power while satisfying the requirements of tag detection, communication, and energy harvesting. To address the corresponding non‐convex problem, the constraints are reformulated into convex second‐order cone constraints, thereby obtaining the globally optimal solution. To further reduce computational complexity, zero‐forcing is employed to design the beamforming vectors, followed by solving a convex optimization problem to determine the optimal power allocation between sensing and communication beams. The simulation results demonstrate the effectiveness of the proposed beamforming designs, highlighting the potential of ISAC‐WPT Backscatter RFID systems.

Non-differentiable second-order symmetric multiobjective fractional variational programming with cones constraints

In this article, we build a pair non-differentiable second-order symmetric multiobjective fractional variational programming models with cone constraints, where each objective function component has a support function for a compact convex set. The (C, ρ, θ)-convexity/(C, ρ, θ)-pseudo-convexity/(C, ρ, θ)-quasiconvexity functions are defined and also, constructed concrete numerical examples for existing such type of functions. The duality results are established by using these aforesaid assumptions.

The Stability of Robustness for Conic Linear Programs with Uncertain Data

Abstract The robust counterpart of a given conic linear program with uncertain data in the constraints is defined as the robust conic linear program that arises from replacing the nominal feasible set by the robust feasible set of points that remain feasible for any possible perturbation of the data within an uncertainty set. Any minor changes in the size of the uncertainty set can result in significant changes, for instance, in the robust feasible set, robust optimal value and the robust optimal set. The concept of quantifying the extent of these deviations is referred to as the stability of robustness. This paper establishes conditions for the stability of robustness under which minor changes in the size of the uncertainty sets lead to only minor changes in the robust feasible set of a given linear program with cone constraints and ball uncertainty sets.

A convex cone programming based implicit material point method

For conventional Material Point Method (MPM), both explicit-based and implicit-based MPM have shortcomings: explicit MPM has high requirements on time steps, and implicit MPM has high requirements on convergence. To circumvent these limitations, this paper innovatively proposes a convex cone programming-based implicit MPM (CP-MPM) algorithm, which ensures excellent convergence of solving complex problems involving large deformation, regardless of the chosen time step. In the proposed CP-MPM, the governing equations are initially transformed into a stationary point of a multivariable functional, leveraging the generalized Hellinger-Reissner (HR) variational principle. This stationary point problem is subsequently reformulated as a min-max convex cone optimization problem, with constraints originating from elastoplastic constitutive equations. In addition, a novel particle-based adhesive-frictional contact algorithm is proposed to effectively tackle the interaction between MPM domain and rigid bodies. The contact inequality between material points and rigid bodies is transformed into convex cone constraints, which rigorously prevent material point penetration and facilitate the imposition of irregular boundary conditions. Both elastic and elastoplastic problems involving contact under static or dynamic loading are ultimately represented as standard second-order cone programming (SOCP) problems, which is effectively solved by employing the Primal-Dual Interior Point (PDIP) method. The robustness, accuracy and convergence of the proposed method are validated through a series of elastic and elastoplastic benchmark problems. All results demonstrate the CP-MPM is a very promising method for implicitly solving complex practices.

Second‐order cone programming models for the unitary weighted Weber problem and for the minimum sum of the squares clustering problem

AbstractIn this work, new mixed integer nonlinear optimization models are proposed for two clustering problems: the unitary weighted Weber problem and the minimum sum of squares clustering. The proposed formulations are convex quadratic models with linear and second‐order cone constraints that can be efficiently solved by interior point algorithms. Their continuous relaxation is convex and differentiable. The numerical experiments show the proposed models are more efficient than some classical models for these problems known in the literature.

Convex Representation of Metabolic Networks with Michaelis–Menten Kinetics

Polyhedral models of metabolic networks are computationally tractable and can predict some cellular functions. A longstanding challenge is incorporating metabolites without losing tractability. In this paper, we do so using a new second-order cone representation of the Michaelis–Menten kinetics. The resulting model consists of linear stoichiometric constraints alongside second-order cone constraints that couple the reaction fluxes to metabolite concentrations. We formulate several new problems around this model: conic flux balance analysis, which augments flux balance analysis with metabolite concentrations; dynamic conic flux balance analysis; and finding minimal cut sets of networks with both reactions and metabolites. Solving these problems yields information about both fluxes and metabolite concentrations. They are second-order cone or mixed-integer second-order cone programs, which, while not as tractable as their linear counterparts, can nonetheless be solved at practical scales using existing software.

Two-stage robust optimization of unified power quality conditioner (UPQC) siting and sizing in active distribution networks considering uncertainty of loads and renewable generators

This paper proposes a robust optimization siting and sizing strategy for the unified power quality conditioner (UPQC) in the active distribution network (ADN) integrated with renewable energy generators. The optimization objectives including investment cost, line loss, and voltage deviation are integrated into an overall cost for both the planning and operating stages. A novel UPQC equivalent power injection model is proposed based on the auxiliary branch method. A set of linear and second-order conic (SOC) constraints are employed to accurately describe the steady-state operation of UPQC. An improved branch current flow model is developed to incorporate radial distribution networks with UPQCs. The UPQC siting and sizing planning is formulated as a mixed integer second-order conic programming (MISOCP) problem. Accounting for the uncertainty in loads and distributed generators, a two-stage robust optimization model is established to address worst-case operational scenarios. A solving strategy is developed based on the strong duality theory and the column-and-constraint generation (C&CG) algorithm, and then commercial solvers can solve the problem accurately and efficiently. Case studies on an IEEE 33-node distribution network demonstrate this strategy's robustness in dealing with loads and renewable energy uncertainties, making it applicable across different UPQC topologies and operation modes. The proposed method has superior performance over the representative meta-heuristic approaches in terms of global optimality as well as an over 7.5 times faster computation speed. This work has significance in enhancing the quality and efficiency of modern power systems highly integrated with renewable energy.

A distributed robust state estimation method based on alternating direction method of multipliers for integrated electricity‐heat system

AbstractIntegrated electricity‐heat system (IEHS) has been paid more and more attention in recent years for its advantage in improving energy efficiency, reducing carbon emissions and increasing renewable energy penetration. To ensure the safety, reliability and economic operation of IEHS, several centralised state estimation (SE) methods for IEHS have been proposed. However, power systems and heat systems often belong to different management entities, and there are industrial barriers such as information privacy, operational differences, and target differences between them, which leads to less applicability of centralised SE methods. In addition, the robustness of existing distributed SE methods for IEHS is not satisfactory. To this end, a distributed robust state estimation (DRSE) model for IEHS based on the alternating direction method of multipliers (ADMM) is proposed. Firstly, by introducing auxiliary state variables and measurements, a robust linear SE model based on weighted least absolute values (WLAV) is proposed. Then, second‐order cone constraints composed of auxiliary state variables are added to the SE model, leading a SOCP‐based robust SE model. Finally, the ADMM algorithm is used to solve the proposed SOCP‐based robust SE model. Simulations demonstrate that the proposed method has higher estimation accuracy in both general and strongly correlated adverse data tests and also can ensure data privacy, good robustness and high estimation accuracy. This indicates that the method proposed has good robustness and solves the problem of weak robustness of existing distributed static state estimation methods.

Shortest path network interdiction with asymmetric uncertainty

AbstractThis paper considers an extension of the shortest path network interdiction problem that incorporates robustness to account for parameter uncertainty. The shortest path interdiction problem is a game of two players with conflicting agendas and capabilities: an evader, who traverses the arcs of a network from a source node to a sink node using a path of shortest length, and an interdictor, who maximizes the length of the evader's shortest path by interdicting arcs on the network. It is usually assumed that the parameters defining the network are known exactly by both players. We consider the situation where the evader assumes the nominal parameter values while the interdictor uses robust optimization techniques to account for parameter uncertainty or sensor degradation. We formulate this problem as a nonlinear mixed‐integer semi‐infinite bilevel program and show that it can be converted into a mixed‐integer linear program with a second order cone constraint. We use random geometric networks and transportation networks to perform computational studies and demonstrate the unique decision strategies that our variant produces. Solving the shortest path interdiction problem with asymmetric uncertainty protects the interdictor from investing in a strategy that hinges on key interdictions performing as promised. It also provides an alternate strategy that mitigates the risk of these worst‐case possibilities.

Second-order cone programming for frictional contact mechanics using interior point algorithm

We report experiments of an implementation of a primal–dual interior point algorithm for solving mechanical models of one-sided contact problems with Coulomb friction. The objective is to recover an optimal solution with high accuracy and as quickly as possible. These developments are part of the design of Siconos, an open-source software for modelling and simulating non-smooth dynamical systems. Currently, Siconos uses mainly first-order methods for the numerical solution of these systems. These methods are very robust, but suffer from a linear rate of convergence and are therefore too slow to find accurate solutions in a reasonable time. Our main objective is to apply second-order methods to speed up convergence. In this paper, we focus on solving a relaxed formulation of the initial mechanical model, corresponding to the optimality conditions of a convex quadratic minimization problem with second-order cone constraints. We will present in detail a primal–dual interior point algorithm for solving this type of problem. The main difficulty in implementing this algorithm arises from the fact that at each iteration of the algorithm, a change of variable, called a scaling, has to be performed in order to guarantee the non-singularity of the linear system to be solved, as well as to recover a symmetric system. Although this scaling strategy is very nice from a theoretical point of view, it leads to an enormous deterioration of the conditioning of the linear system when approaching the optimal solution and therefore to all the numerical difficulties that result from it. We will describe in detail the numerical algebra that we have developed in our implementation, in order to overcome these problems of numerical instability. We will also present the solution of the models resulting from the problems of rolling friction, for which the cone of constraints is no longer self-dual like the Lorentz cone.

Stochastic Data-Driven Predictive Control: Regularization, Estimation, and Constraint Tightening

Data-driven predictive control methods based on the Willems’ fundamental lemma have shown great success in recent years. These approaches use receding horizon predictive control with nonparametric data-driven predictors instead of model-based predictors. This study addresses three problems of applying such algorithms under unbounded stochastic uncertainties: 1) tuning-free regularizer design, 2) initial condition estimation, and 3) reliable constraint satisfaction, by using stochastic prediction error quantification. The regularizer is designed by leveraging the expected output cost. An initial condition estimator is proposed by filtering the measurements with the one-step-ahead stochastic data-driven prediction. A novel constraint-tightening method, using second-order cone constraints, is presented to ensure high-probability chance constraint satisfaction. Numerical results demonstrate that the proposed methods lead to satisfactory control performance in terms of both control cost and constraint satisfaction, with significantly improved initial condition estimation.

MSGL+: Fast and Reliable Model Selection-Inspired Graph Metric Learning

The problem of learning graph-based data structures from data has attracted considerable attention in the past decade. Different types of data can be used to infer the graph structure, such as graphical Lasso, which is learned from multiple graph signals or graph metric learning based on node features. However, most existing methods that use node features to learn the graph face difficulties when the label signals of the data are incomplete. In particular, the pair-wise distance metric learning problem becomes intractable as the dimensionality of the node features increases. To address this challenge, we propose a novel method called MSGL+. MSGL+ is inspired from model selection, leverages recent advancements in graph spectral signal processing (GSP), and offers several key innovations: (1) Polynomial Interpretation: We use a polynomial function of a certain order on the graph Laplacian to represent the inverse covariance matrix of the graph nodes to rigorously formulate an optimization problem. (2) Convex Formulation: We formulate a convex optimization objective with a cone constraint that optimizes the coefficients of the polynomial, which makes our approach efficient. (3) Linear Constraints: We convert the cone constraint of the objective to a set of linear ones to further ensure the efficiency of our method. (4) Optimization Objective: We explore the properties of these linear constraints within the optimization objective, avoiding sub-optimal results by the removal of the box constraints on the optimization variables, and successfully further reduce the number of variables compared to our preliminary work, MSGL. (5) Efficient Solution: We solve the objective using the efficient linear-program-based Frank–Wolfe algorithm. Application examples, including binary classification, multi-class classification, binary image denoising, and time-series analysis, demonstrate that MSGL+ achieves competitive accuracy performance with a significant speed advantage compared to existing graphical Lasso and feature-based graph learning methods.

BilevelJuMP.jl: Modeling and Solving Bilevel Optimization Problems in Julia

In this paper, we present BilevelJuMP.jl, a new Julia package to support bilevel optimization within the JuMP framework. The package is a Julia library that enables the user to describe both upper and lower-level optimization problems using the JuMP algebraic syntax. Because of the generality and flexibility that our library inherits from JuMP’s syntax, our package allows users to model bilevel optimization problems with conic constraints in the lower level and all constraints supported by JuMP in the upper level including conic, quadratic, and nonlinear constraints. Moreover, the models defined with the syntax from BilevelJuMP.jl can be solved by multiple techniques that are based on reformulations as mathematical programs with equilibrium constraints (MPEC). Manipulations on the original problem data are possible due to MathOptInterface.jl’s structures and Dualization.jl features. Hence, the proposed package allows quick modeling, deployment, and thereby experimenting with bilevel models based on off-the-shelf mixed-integer linear programming and nonlinear solvers. History: Accepted by Ted Ralphs, Area Editor for Software Tools. Funding: The authors were partially supported by the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - Brasil (CAPES) - Finance Code 001. The work of A. Street was also partially supported by Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro (FAPERJ) and Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq). The work was partially funded by the project P&D ANEEL PD-00403-0050/2020 sponsored by ENGIE BRASIL ENERGIA S.A. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0135 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0135 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

Approximate optimality conditions and duality results for non-smooth semi-infinite programming problems

This paper concentrates on investigating a semi-infinite optimization problem with cone constraints. Under the attainment of Abadie constraint qualification, an approximate necessary optimality condition by employing Clarke subdifferential for the semi-infinite optimization problem having cone constraints is developed. A new class of functions namely Q-quasiconvex functions is introduced and in the light of the approximate pseudoconvexity and Q-quasiconvexity assumptions, an approximate sufficient optimality condition is investigated using locally Lipschitz functions. Additionally, we formulate the approximate Wolfe's and approximate Mond-Weir dual problems for the non-smooth semi-infinite optimization problem. Subsequently, duality relations in terms of weak, strong and converse results between the semi-infinite optimization model and the aforementioned dual problems are established under the approximate pseudoconvexity and Q-quasiconvexity assumptions. Moreover, to justify the main results of the paper, numerical examples have been shown at suitable places.

Optimization Method of the Clamping Force for Large Cabin Parts

In order to realize the stable clamping of large cabin parts, this paper studied the clamping force optimization of the clamping mechanism for large-mass and large-size cabin parts. Firstly, three kinds of contact models are introduced. Then, a clamping matrix is constructed for a particular clamping configuration. The nonlinear friction cone constraint at the contact point is transformed into a linear affine constraint in a smooth Riemannian manifold using the special structure of the positive definite symmetric matrix. Finally, a large cabin part used in the aerospace field is used as an example for calculating and simulating the clamping force optimization. Different optimization algorithms are used to calculate the initial value which is put into the gradient flow optimization method of the clamping force for optimization calculation. Meanwhile, the normal clamping force value of a 2 t object is measured using relevant experimental equipment. The simulation results and experimental results show that the gradient flow optimization method of the clamping force can quickly complete the clamping force optimization of large-mass and large-size cabin parts. The actual measured value of the normal clamping force is close to the simulated convergence value. The distribution of the normal force of the clamping mechanisms and the convergence value of the clamping force for each clamping mechanism can provide some references for determining the output clamping force of the clamping mechanism and confirming a reasonable distribution of the clamping mechanism. It also confirms the feasibility and effectiveness of this method applied to the clamping force optimization for a large axial part.

Flexible Differentiable Optimization via Model Transformations

We introduce DiffOpt.jl, a Julia library to differentiate through the solution of optimization problems with respect to arbitrary parameters present in the objective and/or constraints. The library builds upon MathOptInterface, thus leveraging the rich ecosystem of solvers and composing well with modeling languages like JuMP. DiffOpt offers both forward and reverse differentiation modes, enabling multiple use cases from hyperparameter optimization to backpropagation and sensitivity analysis, bridging constrained optimization with end-to-end differentiable programming. DiffOpt is built on two known rules for differentiating quadratic programming and conic programming standard forms. However, thanks to its ability to differentiate through model transformations, the user is not limited to these forms and can differentiate with respect to the parameters of any model that can be reformulated into these standard forms. This notably includes programs mixing affine conic constraints and convex quadratic constraints or objective function. History: Accepted by Ted Ralphs, Area Editor for Software Tools. Funding: The work of A. Sharma on DiffOpt.jl was funded by the Google Summer of Code program through NumFocus. M. Besançon was partially supported through the Research Campus Modal funded by the German Federal Ministry of Education and Research [Grant 05M14ZAM, 05M20ZBM]. J. Dias Garcia was supported in part by the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior – Brasil (CAPES) – Finance Code 001. B. Legat was supported by a BAEF Postdoctoral Fellowship, the NSF [Grant OAC-1835443], and the ERC Adv. [Grant 885682]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0283 ), as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0283 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

Optimal Cluster Scheduling of Active–Reactive Power for Distribution Network Considering Aggregated Flexibility of Heterogeneous Building-Integrated DERs

This paper proposes an active–reactive power collaborative scheduling model with cluster division for the flexible distributed energy resources (DERs) of smart-building systems to resolve the high complexity of the centralized optimal scheduling of massive dispersed DERs in the distribution network. Specifically, the optimization objective of each cluster is to minimize the operational cost, the power-loss cost, and the penalty cost for flexibility deficiency, and the second-order cone-based branch flow method is utilized to convert the power-flow equations into linearized cone constraints, reducing the nonlinearity and heavy computation burden of the scheduling model. Customized virtual battery models for building-integrated flexible DERs are developed to aggregate the power characteristics of flexible resources while quantifying their regulation capacities with time-shifting power and energy boundaries. Moreover, a cluster division algorithm considering the module degree index based on the electrical distance and the flexible balance contribution index is formulated for cluster division to achieve information exchange and energy interaction in the distribution network with a high proportion of building-integrated flexible DERs. Comparative studies have demonstrated the superior performance of the proposed methodology in economic merits and voltage regulation.