Live briefing
Everything about Second-order cone programming
Convex optimization problem
A second-order cone program (SOCP) is a convex optimization problem of the formminimize subject to Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Second-order cone programmingA 5-minute orientation
- Skim a recent paper: UAV Collision Avoidance Using Mixed-Integer Second-Order Cone ProgrammingInfluential work since 2022
- Pick up a classic book: Modeling and Optimization: Theory and ApplicationsThe most-reprinted book on the subject
- Read the landmark paper: Applications of second-order cone programmingCited 1,940 times
- Go sideways: Quadratically constrained quadratic programA closely related topic
- Go sideways: Interior-point methodA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Applications of second-order cone programming
Second-order cone programming
Entry Trajectory Optimization by Second-Order Cone Programming
Second‐Order Cone Programming Relaxation of Sensor Network Localization
Perturbation analysis of second-order cone programming problems
Second order cone programming relaxation of nonconvex quadratic optimization problems
Computational Cam clay plasticity using second-order cone programming
Robust array interpolation using second-order cone programming
🆕 Influential since 2022
UAV Collision Avoidance Using Mixed-Integer Second-Order Cone Programming
UAV trajectory optimization using chance-constrained second-order cone programming
Fully Distributed Second-Order Cone Programming Model for Expansion in Transmission and Distribution Networks
Descent Property in Sequential Second-Order Cone Programming for Nonlinear Trajectory Optimization
SONC optimization and exact nonnegativity certificates via second-order cone programming
📚 Books worth reading
Modeling and Optimization: Theory and ApplicationsTamás Terlaky · 2012
A TOUR OF THE WORLDMalik Mansab Khan, Muhammad Rafique Abdul Aziz · 2025
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Quadratically constrained quadratic program In mathematical optimization, a quadratically constrained quadratic program (QCQP) is an optimization problem in which both the objective function and…
- Interior-point method Interior-point methods (also referred to as barrier methods or IPMs) are algorithms for solving linear and non-linear convex optimization problems. IPMs…
- Convex optimization Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets (or, equivalently…
- Conic optimization Conic optimization is a subfield of convex optimization that studies problems consisting of minimizing a convex function over the intersection of an affine…
- Spectrahedron In convex geometry, a spectrahedron is a shape that can be represented as a linear matrix inequality. Alternatively, the set of n × n positive semidefinite…
- MOSEK MOSEK is a software package for the solution of linear, mixed-integer linear, quadratic, mixed-integer quadratic, quadratically constrained, conic and…
- Sum-of-squares optimization A sum-of-squares optimization program is an optimization problem with a linear cost function and constraints that certain polynomials constructed from…
- Nonlinear programming In mathematics, nonlinear programming (NLP), also known as nonlinear optimization, is the process of solving an optimization problem where some of the…