An affine scaling method for optimization problems with polyhedral constraints

DOI10.1007/s10589-013-9535-xzbMath1303.90100OpenAlexW2145958546MaRDI QIDQ742300

William W. Hager, Hongchao Zhang

Publication date: 18 September 2014

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-013-9535-x

zbMATH Keywords

global convergencebox constraintslinear constraintslocal convergenceinterior pointaffine scalingCBBcyclic Barzilai-Borwein methodspolyhedral constraints

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

An augmented Lagrangian affine scaling method for nonlinear programming, An active set algorithm for nonlinear optimization with polyhedral constraints, Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds, A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization, Nonmonotone conic trust region method with line search technique for bound constrained optimization

Cites Work

• Unnamed Item
• A first-order interior-point method for linearly constrained smooth optimization
• An affine-scaling interior-point CBB method for box-constrained optimization
• Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems
• Trust region affine scaling algorithms for linearly constrained convex and concave programs
• Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization
• The primal power affine scaling method
• Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
• An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines
• Two-Point Step Size Gradient Methods
• Some continuity properties of polyhedral multifunctions
• A Trust Region Interior Point Algorithm for Linearly Constrained Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• The cyclic Barzilai-–Borwein method for unconstrained optimization