Analysis of some interior point continuous trajectories for convex programming
From MaRDI portal
Publication:5277955
DOI10.1080/02331934.2017.1279160zbMath1391.90479OpenAlexW2574197637MaRDI QIDQ5277955
Xun Qian, Li-Zhi Liao, Jie Sun
Publication date: 12 July 2017
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11937/52592
convex programminginterior point methodprimal-dual affine scaling methodcontinuous trajectoryprimal-dual path-following method
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Interior-point methods (90C51)
Related Items
Cites Work
- Unnamed Item
- A study of the dual affine scaling continuous trajectories for linear programming
- A first-order interior-point method for linearly constrained smooth optimization
- A polynomial-time algorithm, based on Newton's method, for linear programming
- New trajectory-following polynomial-time algorithm for linear programming problems
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Global convergence of the affine scaling methods for degenerate linear programming problems
- A survey of search directions in interior point methods for linear programming
- On the convergence of the affine-scaling algorithm
- An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
- A globally convergent primal-dual interior point algorithm for convex programming
- A primal-dual interior point method whose running time depends only on the constraint matrix
- On the existence and convergence of the central path for convex programming and some duality results
- Examples of ill-behaved central paths in convex optimization
- On well definedness of the central path
- A simple proof of a primal affine scaling method
- A convergence analysis for a convex version of Dikin's algorithm
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- A Centered Projective Algorithm for Linear Programming
- Boundary Behavior of Interior Point Algorithms in Linear Programming
- Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming
- On the Continuous Trajectories for a Potential Reduction Algorithm for Linear Programming
- A path following algorithm for a class of convex programming problems
- Path-Following Methods for Linear Programming
- Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
- Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem
- Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
