Corrector-predictor interior-point method with new search direction for semidefinite optimization

DOI10.1007/s10915-023-02137-1zbMath1519.90154OpenAlexW4321248123MaRDI QIDQ6159295

Behrouz Kheirfam

Publication date: 20 June 2023

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10915-023-02137-1

zbMATH Keywords

interior-point methodssemidefinite optimizationpolynomial complexitycorrector-predictor methodsnew search directions

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
• A full-Newton step interior-point algorithm for symmetric cone convex quadratic optimization
• An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
• 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 full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• A long-step primal-dual path-following method for semidefinite programming
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• 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
• Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
• A corrector-predictor interior-point method with new search direction for linear optimization
• A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
• A corrector-predictor path-following method for convex quadratic symmetric cone optimization
• Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization
• A new corrector-predictor interior-point method for symmetric cone optimization
• A corrector–predictor path-following method for second-order cone optimization
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• On the Implementation of a Primal-Dual Interior Point Method
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• Linear Matrix Inequalities in System and Control Theory
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• New complexity analysis of a full Nesterov–Todd step interior-point method for semidefinite optimization
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• On the Convergence of the Central Path in Semidefinite Optimization
• An Interior-Point Method for Semidefinite Programming
• Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction

This page was built for publication: Corrector-predictor interior-point method with new search direction for semidefinite optimization