Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs

DOI10.1007/BF01581723zbMath0897.90183OpenAlexW2003324738MaRDI QIDQ1380924

Susumu Shindoh, Masayuki Shida, Kojima, Masakazu

Publication date: 11 March 1998

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01581723

zbMATH Keywords

superlinear convergenceinfeasible-interior-point methodsemidefinite programpredictor-corrector-methodprimal-dual nondegeneracy

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function, The bundle scheme for solving arbitrary eigenvalue optimizations, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones, A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence, A method for weighted projections to the positive definite cone, An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results, Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems, A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations, Exploiting sparsity in primal-dual interior-point methods for semidefinite programming, Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems, Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization, A space decomposition scheme for maximum eigenvalue functions and its applications, Strong duality and minimal representations for cone optimization, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy, A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization, Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming, Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step, Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems, Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming, A full NT-step infeasible interior-point algorithm for semidefinite optimization, On the extension of an arc-search interior-point algorithm for semidefinite optimization, Generating and measuring instances of hard semidefinite programs, Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search, Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function, Exact algorithms for semidefinite programs with degenerate feasible set, A polynomial time constraint-reduced algorithm for semidefinite optimization problems, Analyticity of weighted central paths and error bounds for semidefinite programming, A fast space-decomposition scheme for nonconvex eigenvalue optimization, Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems, An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming, Inexact non-interior continuation method for monotone semidefinite complementarity problems, Equivalence of two nondegeneracy conditions for semidefinite programs, Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence, Extension of smoothing Newton algorithms to solve linear programming over symmetric cones, Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming, Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem, Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects, A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization, Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming, Superlinear convergence of interior-point algorithms for semidefinite programming, A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming, Affine scaling algorithm fails for semidefinite programming, Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP, Inexact non-interior continuation method for solving large-scale monotone SDCP, Analyticity of the central path at the boundary point in semidefinite programming, Interior-point methods, On long-step predictor-corrector interior-point algorithm for semidefinite programming with Monteiro-Zhang unified search directions, Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants, Sdpha: a Matlab implementation of homogeneous interior-point algorithms for semidefinite programming, Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization, Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp^∗, Unnamed Item, Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term

Uses Software

• SDPA

Cites Work

• Unnamed Item
• Unnamed Item
• Interior path following primal-dual algorithms. I: Linear programming
• A polynomial-time algorithm for a class of linear complementarity problems
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• Superlinear convergence of interior-point algorithms for semidefinite programming
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
• Local convergence of interior-point algorithms for degenerate monotone LCP
• A primal-dual potential reduction method for problems involving matrix inequalities
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh--Haeberly--Overton Search Direction
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
• Semidefinite Programming
• An Interior-Point Method for Semidefinite Programming
• A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition