A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization

DOI10.1007/s10957-012-0013-xzbMath1256.90036OpenAlexW1996300679MaRDI QIDQ1937023

Yan-Qin Bai, Guo-Qiang Wang

Publication date: 11 February 2013

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-012-0013-x

zbMATH Keywords

Euclidean Jordan algebrasinterior-point methodssmall-update methodsymmetric optimization

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51)

Related Items (60)

Variational inequality formulation of circular cone eigenvalue complementarity problems ⋮ Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier ⋮ An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones ⋮ Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function ⋮ Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation ⋮ A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming ⋮ A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ⁻¹) iteration complexity ⋮ Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems ⋮ An infeasible interior-point method with improved centering steps for monotone linear complementarity problems ⋮ An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function ⋮ Full Nesterov–Todd step feasible interior-point method for the CartesianP_*(κ)-SCLCP ⋮ Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions ⋮ A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization ⋮ A new infeasible-interior-point algorithm for linear programming over symmetric cones ⋮ A two-parametric class of merit functions for the second-order cone complementarity problem ⋮ The models of bilevel programming with lower level second-order cone programs ⋮ Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone ⋮ A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming ⋮ Complexity analysis of a full-{N}ewton step interior-point method for linear optimization ⋮ A new corrector-predictor interior-point method for symmetric cone optimization ⋮ An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization ⋮ A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems ⋮ New complexity analysis of a full Nesterov–Todd step interior-point method for semidefinite optimization ⋮ Interior-point algorithm for linear programming based on a new descent direction ⋮ Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations ⋮ Corrector-predictor interior-point method with new search direction for semidefinite optimization ⋮ Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions ⋮ A class of new search directions for full-NT step feasible interior point method in semidefinite optimization ⋮ A new search direction for full-Newton step infeasible interior-point method in linear optimization ⋮ A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization ⋮ An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones ⋮ New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function ⋮ A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization ⋮ A Corrector-Predictor Interior-Point Algorithm for P_∗(κ)-HLCPs Over Cartesian Product of Symmetric Cones ⋮ A new infeasible interior-point method based on Darvay's technique for symmetric optimization ⋮ A weighted-path-following method for symmetric cone linear complementarity problems ⋮ A generalized direction in interior point method for monotone linear complementarity problems ⋮ Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function ⋮ A new full-NT step interior-point method for circular cone optimization ⋮ A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming ⋮ Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization ⋮ A long-step interior-point algorithm for symmetric cone Cartesian P_*(κ)-HLCP ⋮ A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function ⋮ A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION BASED ON AN EXPONENTIAL KERNEL FUNCTION ⋮ A corrector-predictor path-following method for convex quadratic symmetric cone optimization ⋮ A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions ⋮ A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization ⋮ A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization ⋮ New method for determining search directions for interior-point algorithms in linear optimization ⋮ A New Infeasible Interior-Point Method Based on a Non-Coercive Kernel Function with Improved Centering Steps for Second-Order Cone Optimization ⋮ Unnamed Item ⋮ A modified infeasible interior-point algorithm for P*(κ)-HLCP over symmetric cones ⋮ An extension for identifying search directions for interior-point methods in linear optimization ⋮ A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization ⋮ On theP_*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction ⋮ Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming ⋮ Unnamed Item ⋮ Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization ⋮ Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization

Cites Work

• Unnamed Item
• A new primal-dual path-following method for convex quadratic programming
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
• Extension of primal-dual interior point algorithms to symmetric cones
• Similarity and other spectral relations for symmetric cones
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• On a commutative class of search directions for linear programming over symmetric cones
• Function spaces and reproducing kernels on bounded symmetric domains
• A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
• Barrier Functions in Interior Point Methods
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• On homogeneous interrior-point algorithms for semidefinite programming
• Conic convex programming and self-dual embedding
• On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
• Handbook of semidefinite programming. Theory, algorithms, and applications
• A Jordan-algebraic approach to potential-reduction algorithms

This page was built for publication: A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization