A new corrector-predictor interior-point method for symmetric cone optimization
From MaRDI portal
Publication:2678433
DOI10.1007/s10998-021-00443-5OpenAlexW4206622038MaRDI QIDQ2678433
Publication date: 23 January 2023
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10998-021-00443-5
Euclidean Jordan algebraspolynomial complexitysymmetric cone optimizationcorrector-predictor methods
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Corrector-predictor methods for sufficient linear complementarity problems
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
- A new polynomial-time algorithm for linear programming
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Similarity and other spectral relations for symmetric cones
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A corrector-predictor interior-point method with new search direction for linear optimization
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization
- A corrector–predictor path-following method for second-order cone optimization
- A predictor-corrector path-following algorithm for symmetric optimization based on Darvay's technique
- On the Implementation of a Primal-Dual Interior Point Method
- On the Nesterov--Todd Direction in Semidefinite Programming
- Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Barrier Functions in Interior Point Methods
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function
- Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
This page was built for publication: A new corrector-predictor interior-point method for symmetric cone optimization
