An interior point parameterized central path following algorithm for linearly constrained convex programming
From MaRDI portal
Publication:2113635
DOI10.1007/s10915-022-01765-3zbMath1486.90144OpenAlexW4210879547MaRDI QIDQ2113635
Xun Qian, Jie Sun, Liangshao Hou, Li-Zhi Liao
Publication date: 14 March 2022
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-022-01765-3
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Interior-point methods (90C51)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A study of the dual affine scaling continuous trajectories for linear programming
- A new polynomial-time algorithm for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- Interior-point Lagrangian decomposition method for separable convex optimization
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A polynomial-time algorithm for a class of linear complementarity problems
- On some efficient interior point methods for nonlinear convex programming
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- On the complexity of following the central path of linear programs by linear extrapolation. II
- On the convergence of the affine-scaling algorithm
- An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
- A simplified global convergence proof of the affine scaling algorithm
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- On the classical logarithmic barrier function method for a class of smooth convex programming problems
- A globally convergent primal-dual interior point algorithm for convex programming
- On the existence and convergence of the central path for convex programming and some duality results
- Non-interior continuation methods for solving semidefinite complementarity problems
- A polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques
- On well definedness of the central path
- A global linear and local quadratic continuation smoothing method for variational inequalities with box constraints
- On controlling the parameter in the logarithmic barrier term for convex programming problems
- A convergence analysis for a convex version of Dikin's algorithm
- A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
- A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems
- The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems
- A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations
- A Centered Projective Algorithm for Linear Programming
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- A duality theorem for non-linear programming
- A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
- Homotopy Continuation Methods for Nonlinear Complementarity Problems
- 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
- A generalized interior-point barrier function approach for smooth convex programming with linear constraints
- Asymptotic analysis of a path-following barrier method for linearly constrained convex problems*
- A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems
- Penalty/barrier path-following in linearly constrained optimization
- The Convergent Generalized Central Paths for Linearly Constrained Convex Programming
- A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems
- Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
- A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
- A Global and Local Superlinear Continuation-Smoothing Method forP0andR0NCP or Monotone NCP
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Analysis of some interior point continuous trajectories for convex programming
- A combination of potential reduction steps and steepest descent steps for solving convex programming problems
- A projected‐steepest‐descent potential‐reduction algorithm for convex programming problems
- Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
- Complexity of a noninterior path-following method for the linear complementarity problem
