A polynomial time infeasible interior-point arc-search algorithm for convex optimization
From MaRDI portal
Abstract: This paper proposes an infeasible interior-point algorithm for the convex optimization problem using arc-search techniques. The proposed algorithm simultaneously selects the centering parameter and the step size, aiming at optimizing the performance in every iteration. Analytic formulas for the arc-search are provided to make the arc-search method very efficient. The convergence of the algorithm is proved and a polynomial bound of the algorithm is established. The preliminary numerical test results indicate that the algorithm is efficient and effective.
Recommendations
- An infeasible interior-point arc-search algorithm for nonlinear constrained optimization
- A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization
- An arc-search interior point method in the \(\mathcal N^{-}_\infty\) neighborhood for symmetric optimization
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- scientific article; zbMATH DE number 2091971
Cites work
- A feasible BFGS interior point algorithm for solving convex minimization problems
- A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization
- A globally convergent primal-dual interior point algorithm for convex programming
- A polynomial arc-search interior-point algorithm for convex quadratic programming
- A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems
- A polynomial path following algorithm for convex programming
- A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization
- A polynomial-time algorithm for a class of linear complementarity problems
- A primal-dual interior-point algorithm with arc-search for semidefinite programming
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
- An interior-point algorithm for linear programming with optimal selection of centering parameter and step size
- Arc-search techniques for interior-point methods
- Computational experience with a primal-dual interior point method for linear programming
- Convex optimization: algorithms and complexity
- Decentralized Online Convex Optimization With Feedback Delays
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Interior-point methods for convex programming
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- Sequential Minimax Search for a Maximum
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
Cited in
(3)
This page was built for publication: A polynomial time infeasible interior-point arc-search algorithm for convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173777)
