An Active Set Method for Single-Cone Second-Order Cone Programs [PDF]
Summary: We develop an active set method for solving second-order cone programs that may have an arbitrary number of linear constraints but are restricted to having only one second-order cone constraint. Problems of this form arise in the context of robust optimization and trust region methods.
Erdoğan, E., Iyengar, G.
openaire +2 more sources
Feature Scaling via Second-Order Cone Programming [PDF]
Feature scaling has attracted considerable attention during the past several decades because of its important role in feature selection. In this paper, a novel algorithm for learning scaling factors of features is proposed. It first assigns a nonnegative scaling factor to each feature of data and then adopts a generalized performance measure to learn ...
openaire +1 more source
Application and Research of Humanoid Robot Based on Second-Order Cone Programming
It is an extremely complex process of controlling walking motion for humanoid robot, and its dynamics model has many rich features. The article puts forward a kind of optimization design method on any time humanoid robot walking movement.
Piao Song-hao +3 more
doaj +2 more sources
Due to the existence of nonlinear constraints, it is difficult to solve the power flow directly. This paper proposes a microgrid optimal scheduling strategy using second-order cone relaxation method to realize linear transformation, so as to minimize the
Fan Zhang +4 more
doaj +1 more source
A Second-Order Cone Programming Model for Planning PEV Fast-Charging Stations [PDF]
This paper studies siting and sizing of plug-in electric vehicle (PEV) fast-charging stations on coupled transportation and power networks. We develop a closed-form model for PEV fast-charging stations’ service abilities, which considers heterogeneous ...
Hongcai Zhang +4 more
semanticscholar +1 more source
Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming [PDF]
The constant rank constraint qualification, introduced by Janin in 1984 for nonlinear programming, has been extensively used for sensitivity analysis, global convergence of first- and second-order algorithms, and for computing the directional derivative ...
R. Andreani +5 more
semanticscholar +1 more source
Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs [PDF]
Several types of relaxations for binary quadratic polynomial programs can be obtained using linear, second-order cone, or semidefinite techniques. In this paper, we propose a general framework to construct conic relaxations for binary quadratic polynomial programs based on polynomial programming.
Ghaddar, B., Vera, J.C., Anjos, M.F.
openaire +3 more sources
SONC Optimization and Exact Nonnegativity Certificates via Second-Order Cone Programming [PDF]
The second-order cone (SOC) is a class of simple convex cones and optimizing over them can be done more efficiently than with semidefinite programming.
Victor Magron, Jie Wang
semanticscholar +1 more source
Null Broadening Robust Beamforming Based on Decomposition and Iterative Second-order Cone Programming [PDF]
To solve the problem that the performance of adaptive beamformer degrades severely in the presence of steering vector mismatch or non-stationary interference, a null broadening robust beamforming based on decomposition and iterative second-order cone ...
W. Jin, Y. Z. Guo, W. M. Jia, J. W. Zhao
doaj
Primal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser.
Baha Alzalg, M. Pirhaji
doaj +1 more source

