Second-order cone programming (SOCP) problems are convex optimization problems in which a linear function is minimized over the intersection of an affine linear manifold with the Cartesian product of second-order (Lorentz) cones. Lin-ear programs, convex quadratic programs and quadratically constrained conve
Second-order cone programming is a useful tool for many practical applications and theoretical devel...
In this paper, we focus on the mathematical program with second-order cone (SOC) com-plementarity co...
In this work, we propose an inexact interior proximal-type algorithm for solving convex second-order...
The second-order cone (SOC), also called the Lorentz cone, is a special class of convex cones. So fa...
AbstractIn a second-order cone program (SOCP) a linear function is minimized over the intersection o...
This book covers all of the concepts required to tackle second-order cone programs (SOCPs), in order...
1 This work discusses the roles of second-order cone programming, these tasks are a special class se...
Abstract Second order cone program (SOCP) formulations of convex optimization problems are stud-ied....
Interior point methods (IPM) have been developed for all types of constrained optimization problems....
Abstract We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP...
Abstract A disadvantage of the SDP (semidefinite programming) relaxation method for quadratic and/or...
[[abstract]]The vector-valued functions associated with second-order cones have been much studied in...
Este trabalho teve como foco o estudo de problemas SOCP, tanto nos seus aspectos teóricos quanto nos...
2 Convex programming which includes linear second-order cone programming (LSOCP) and linear semideni...
Based on the Q method for SDP, we develop the Q method for SOCP. A modified Q method is also introdu...
Second-order cone programming is a useful tool for many practical applications and theoretical devel...
In this paper, we focus on the mathematical program with second-order cone (SOC) com-plementarity co...
In this work, we propose an inexact interior proximal-type algorithm for solving convex second-order...
The second-order cone (SOC), also called the Lorentz cone, is a special class of convex cones. So fa...
AbstractIn a second-order cone program (SOCP) a linear function is minimized over the intersection o...
This book covers all of the concepts required to tackle second-order cone programs (SOCPs), in order...
1 This work discusses the roles of second-order cone programming, these tasks are a special class se...
Abstract Second order cone program (SOCP) formulations of convex optimization problems are stud-ied....
Interior point methods (IPM) have been developed for all types of constrained optimization problems....
Abstract We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP...
Abstract A disadvantage of the SDP (semidefinite programming) relaxation method for quadratic and/or...
[[abstract]]The vector-valued functions associated with second-order cones have been much studied in...
Este trabalho teve como foco o estudo de problemas SOCP, tanto nos seus aspectos teóricos quanto nos...
2 Convex programming which includes linear second-order cone programming (LSOCP) and linear semideni...
Based on the Q method for SDP, we develop the Q method for SOCP. A modified Q method is also introdu...
Second-order cone programming is a useful tool for many practical applications and theoretical devel...
In this paper, we focus on the mathematical program with second-order cone (SOC) com-plementarity co...
In this work, we propose an inexact interior proximal-type algorithm for solving convex second-order...
Add to ORKG