Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization
From MaRDI portal
Publication:1777447
DOI10.1007/S10898-004-8276-XzbMath1066.90076OpenAlexW1967862529MaRDI QIDQ1777447
Publication date: 17 May 2005
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-004-8276-x
Related Items (9)
Multi-standard quadratic optimization: Interior point methods and cone programming reformulation ⋮ An augmented Lagrangian affine scaling method for nonlinear programming ⋮ Newton-KKT interior-point methods for indefinite quadratic programming ⋮ A trust region affine scaling method for bound constrained optimization ⋮ An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints ⋮ A first-order interior-point method for linearly constrained smooth optimization ⋮ An affine scaling method for optimization problems with polyhedral constraints ⋮ Hessian Barrier Algorithms for Linearly Constrained Optimization Problems ⋮ A trust region method based on a new affine scaling technique for simple bounded optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modification of Karmarkar's linear programming algorithm
- Two-thirds is sharp for affine scaling
- A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions
- A new polynomial-time algorithm for linear programming
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- Algorithms for bound constrained quadratic programming problems
- Global convergence of the affine scaling methods for degenerate linear programming problems
- On affine scaling algorithms for nonconvex quadratic programming
- On the convergence of the affine-scaling algorithm
- A simplified global convergence proof of the affine scaling algorithm
- Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems
- Convergence of the dual variables for the primal affine scaling method with unit steps in the homogeneous case
- Trust region affine scaling algorithms for linearly constrained convex and concave programs
- On some interior-point algorithms for nonconvex quadratic optimization
- A note on Mascarenhas' counterexample about global convergence of the affine scaling algorithm
- Affine-scaling for linear programs with free variables
- A simple proof of a primal affine scaling method
- An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
- A convergence analysis for a convex version of Dikin's algorithm
- Superlinear convergence of the affine scaling algorithm
- Chaotic Behavior of the Affine Scaling Algorithm for Linear Programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- The Affine Scaling Algorithm Fails for Stepsize 0.999
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
- A Trust Region Interior Point Algorithm for Linearly Constrained Optimization
- Global Convergence of the Affine Scaling Algorithm for Convex Quadratic Programming
- Trust Region Methods
- The trust region affine interior point algorithm for convex and nonconvex quadratic programming
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
This page was built for publication: Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization
