Primal-dual path-following algorithms for circular programming
From MaRDI portal
Recommendations
- A path following interior-point method for linear complementarity problems over circular cones
- Primal-dual interior-point algorithms for convex quadratic circular cone optimization
- Elliptic cone optimization and primal-dual path-following algorithms
- An O( n L) iteration primal-dual path-following method, based on wide neighbourhood and large update, for second-order cone programming
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
Cited in
(10)- A path following interior-point method for linear complementarity problems over circular cones
- A logarithmic barrier interior-point method based on majorant functions for second-order cone programming
- Primal-dual interior-point algorithms for convex quadratic circular cone optimization
- An infeasible full NT-step interior point method for circular optimization
- The primal-dual second-order cone approximations algorithm for symmetric cone programming
- Elliptic cone optimization and primal-dual path-following algorithms
- Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming
- On the symmetry of induced norm cones
- A path-following slgorithm for stochastic quadratically constrained convex quadratic programming in a Hilbert space
- The Jordan algebraic structure of the rotated quadratic cone
This page was built for publication: Primal-dual path-following algorithms for circular programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598307)
