An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming
From MaRDI portal
Publication:1999885
DOI10.1007/s10915-018-0827-2zbMath1415.65141OpenAlexW2894190237MaRDI QIDQ1999885
Publication date: 27 June 2019
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-018-0827-2
semi-definite programmingcomplexity boundwide neighborhoodinfeasible-interior-point methodadaptive updating scheme
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Interior-point methods (90C51)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial time second order mehrotra-type predictor--corrector algorithms
- 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
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Self-regular functions and new search directions for linear and semidefinite optimization
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming
- A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming
- A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- On Mehrotra-Type Predictor-Corrector Algorithms
- On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization
- On the Implementation of a Primal-Dual Interior Point Method
- On the Nesterov--Todd Direction in Semidefinite Programming
- Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Linear Matrix Inequalities in System and Control Theory
- 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 Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- On homogeneous interrior-point algorithms for semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- SDPLIB 1.2, a library of semidefinite programming test problems
- Conic convex programming and self-dual embedding
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- An Interior-Point Method for Semidefinite Programming
- On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
This page was built for publication: An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming
