A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
From MaRDI portal
Publication:4229460
DOI10.1137/S1052623495294955zbMath0917.65058OpenAlexW1994350792MaRDI QIDQ4229460
Florian A. Potra, Rongqin Sheng
Publication date: 22 February 1999
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623495294955
semidefinite programmingsuperlinear convergencepath-following algorithmprimal-dual probleminfeasible-interior-point algorithm
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Related Items
A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A SELF-REGULAR PROXIMITY, A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence, A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem, A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization, Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization, A solution method for combined semi-infinite and semi-definite programming, Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs, A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization, A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming, A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms, An infeasible interior-point algorithm for stochastic second-order cone optimization, An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization, A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization, Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step, A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems, Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems, On the extension of an arc-search interior-point algorithm for semidefinite optimization, A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood, Robust envelope-constrained filter with orthonormal bases and semi-definite and semi-infinite programming, Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function, 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 polynomial time constraint-reduced algorithm for semidefinite optimization problems, Analyticity of weighted central paths and error bounds for semidefinite programming, Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming, A fast space-decomposition scheme for nonconvex eigenvalue optimization, An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming, Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence, Solving semidefinite programming problems via alternating direction methods, Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming, A relaxed cutting plane method for semi-infinite semi-definite programming, High-accuracy solution of large-scale semidefinite programs, 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, 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, Error Bounds and Singularity Degree in Semidefinite Programming, 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, Unnamed Item
