The nonconvex second-order cone: algebraic structure toward optimization
From MaRDI portal
Publication:6536840
Recommendations
- Jordan-algebraic aspects of nonconvex optimization over symmetric cones
- Further development in convex conic reformulation of geometric nonconvex conic optimization problems
- The algebraic structure of the arbitrary-order cone
- The Jordan algebraic structure of the circular cone
- How to convexify the intersection of a second order cone and a nonconvex quadratic
Cites work
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 912648 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- A Global Algorithm for Nonlinear Semidefinite Programming
- A self-concordance property for nonconvex semidefinite programming
- Algèbre commutative
- An interior-point algorithm for large-scale nonlinear optimization with inexact step computations
- An interior-point algorithm for nonconvex nonlinear programming
- Decomposition-based interior point methods for stochastic quadratic second-order cone programming
- Elliptic cone optimization and primal-dual path-following algorithms
- Extended Lorentz cones and mixed complementarity problems
- Extension of primal-dual interior point algorithms to symmetric cones
- Gravitational waves in the relativistic theory of gravity
- Inextensible flows of space curves according to a new orthogonal frame with curvature in \(\mathbb{E}_1^3\)
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts
- Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
- Local Duality of Nonlinear Semidefinite Programming
- Lorentzian manifolds properly isometrically embeddable in Minkowski spacetime
- Matrix Analysis
- Nonlinear rescaling Lagrangians for nonconvex semidefinite programming
- Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
- On duality theory for non-convex semidefinite programming
- Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- Second-order cone programming
- Singular value decomposition in Minkowski space
- Spacetime and geometry. An introduction to general relativity
- Stochastic second-order cone programming: applications models
- The Jordan algebraic structure of the circular cone
- The Minnesota notes on Jordan algebras and their applications. Edited and annotated by Aloys Krieg and Sebastian Walcher
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- The convex and monotone functions associated with second-order cone
- The monotone extended second-order cone and mixed complementarity problems
This page was built for publication: The nonconvex second-order cone: algebraic structure toward optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536840)