A new full-NT step interior-point method for circular cone optimization
From MaRDI portal
Recommendations
- A full Nesterov-Todd step interior-point method for circular cone optimization
- An infeasible full NT-step interior point method for circular optimization
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
Cites work
- A full Nesterov-Todd step interior-point method for circular cone optimization
- A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
- A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A new polynomial-time algorithm for linear programming
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- A new primal-dual path-following method for convex quadratic programming
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Extension of primal-dual interior point algorithms to symmetric cones
- Full Nesterov-Todd step feasible interior-point method for the Cartesian \(P_{\ast}(\kappa)\)-SCLCP
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
- New interior point algorithms in linear programming
- New method for determining search directions for interior-point algorithms in linear optimization
- Pivot versus interior point methods: Pros and cons
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Second-order cone programming
- The Jordan algebraic structure of the circular cone
Cited in
(8)- A path following interior-point method for linear complementarity problems over circular cones
- Primal-dual interior-point algorithms for convex quadratic circular cone optimization
- An infeasible full NT-step interior point method for circular optimization
- A full Nesterov-Todd step interior-point method for circular cone optimization
- Interior-point algorithm for linear programming based on a new descent direction
- A dual method for polar cuts in disjoint bilinear programming
- An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization
- A polynomial-time interior-point method for circular cone programming based on kernel functions
This page was built for publication: A new full-NT step interior-point method for circular cone optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5147630)
