A new full-NT step interior-point method for circular cone optimization
From MaRDI portal
Publication:5147630
DOI10.17535/crorr.2019.0023zbMath1458.90636OpenAlexW4249425072MaRDI QIDQ5147630
Publication date: 27 January 2021
Published in: Croatian Operational Research Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.17535/crorr.2019.0023
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
- New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
- A new primal-dual path-following method for convex quadratic programming
- New method for determining search directions for interior-point algorithms in linear optimization
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A new polynomial-time algorithm for linear programming
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- Extension of primal-dual interior point algorithms to symmetric cones
- Second-order cone programming
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Pivot versus interior point methods: Pros and cons
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- A full Nesterov-Todd step interior-point method for circular cone optimization
- Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP
- The Jordan algebraic structure of the circular cone
This page was built for publication: A new full-NT step interior-point method for circular cone optimization
