Elliptic cone optimization and primal-dual path-following algorithms
From MaRDI portal
Recommendations
- Primal-dual path-following algorithms for circular programming
- Primal-dual interior-point algorithms for convex quadratic circular cone optimization
- A path following interior-point method for linear complementarity problems over circular cones
- Extension of primal-dual interior point algorithms to symmetric cones
- The primal-dual second-order cone approximations algorithm for symmetric cone programming
Cited in
(10)- A logarithmic barrier interior-point method based on majorant functions for second-order cone programming
- Primal-dual path-following algorithms for circular programming
- Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming
- On the symmetry of induced norm cones
- On the self-duality and homogeneity of ellipsoidal cones
- The nonconvex second-order cone: algebraic structure toward optimization
- The Jordan algebraic structure of the rotated quadratic cone
- Algebraic-based primal interior-point algorithms for stochastic infinity norm optimization
- Algebraic and metric structures of the geometric mean cone
- Ellipsoidal cone eigenvalue complementarity problems: solvability conditions, reformulations and numerical experiments
This page was built for publication: Elliptic cone optimization and primal-dual path-following algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598864)
