An interior point parameterized central path following algorithm for linearly constrained convex programming

DOI10.1007/S10915-022-01765-3zbMATH Open1486.90144OpenAlexW4210879547MaRDI QIDQ2113635FDOQ2113635

Xun Qian, Jie Sun, L. S. 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

Recommendations

• A polynomial path following algorithm for convex programming
• On some efficient interior point methods for nonlinear convex programming
• Analysis of some interior point continuous trajectories for convex programming
• scientific article; zbMATH DE number 2201985
• A primal-infeasible interior point algorithm for linearly constrained convex programming

zbMATH Keywords

convex programminginterior point methodpath followingpolynomial-time complexity

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Interior-point methods (90C51) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• A new polynomial-time algorithm for linear programming
• An unconstrained optimization test functions collection
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• On some efficient interior point methods for nonlinear convex programming
• Title not available (Why is that?)
• An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
• A path following algorithm for a class of convex programming problems
• Title not available (Why is that?)
• 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
• Some Noninterior Continuation Methods for Linear Complementarity Problems
• A polynomial-time algorithm for a class of linear complementarity problems
• On the complexity of following the central path of linear programs by linear extrapolation. II
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
• A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
• Interior path following primal-dual algorithms. I: Linear programming
• A duality theorem for non-linear programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• Interior-point Lagrangian decomposition method for separable convex optimization
• Non-interior continuation methods for solving semidefinite complementarity problems
• The global linear convergence of a noninterior path-following algorithm for linear complementarity problems
• A Non-Interior-Point Continuation Method for Linear Complementarity Problems
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• A Centered Projective Algorithm for Linear Programming
• A global linear and local quadratic continuation smoothing method for variational inequalities with box constraints
• A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
• A Global and Local Superlinear Continuation-Smoothing Method forP₀andR₀NCP or Monotone NCP
• Title not available (Why is that?)
• Homotopy Continuation Methods for Nonlinear Complementarity Problems
• Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
• On the existence and convergence of the central path for convex programming and some duality results
• On well definedness of the central path
• On the convergence of the affine-scaling algorithm
• Limiting behavior of the affine scaling continuous trajectories for linear programming problems
• Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming
• A study of the dual affine scaling continuous trajectories for linear programming
• Penalty/barrier path-following in linearly constrained optimization
• A simplified global convergence proof of the affine scaling algorithm
• A convergence analysis for a convex version of Dikin's algorithm
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• A polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques
• An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
• A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
• A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems
• Title not available (Why is that?)
• A generalized interior-point barrier function approach for smooth convex programming with linear constraints
• Complexity of a noninterior path-following method for the linear complementarity problem
• A globally convergent primal-dual interior point algorithm for convex programming
• A polynomial-time descent method for separable convex optimization problems with linear constraints
• A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems
• On the Continuous Trajectories for a Potential Reduction Algorithm for Linear Programming
• On controlling the parameter in the logarithmic barrier term for convex programming problems
• A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems
• The Convergent Generalized Central Paths for Linearly Constrained Convex Programming
• Asymptotic analysis of a path-following barrier method for linearly constrained convex 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

Cited In (4)

• Some non-interior path-following methods based on a scaled central path for linear complementarity problems
• Title not available (Why is that?)
• A polynomial path following algorithm for convex programming
• A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization

Uses Software

• Ipopt

This page was built for publication: An interior point parameterized central path following algorithm for linearly constrained convex programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113635)