A partial first-order affine-scaling method
From MaRDI portal
Publication:1734900
DOI10.1007/s10114-017-7097-zzbMath1461.65153OpenAlexW2775790982MaRDI QIDQ1734900
Publication date: 27 March 2019
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-017-7097-z
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)
Uses Software
Cites Work
- A first-order interior-point method for linearly constrained smooth optimization
- A modification of Karmarkar's linear programming algorithm
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- A simple characterization of solutions sets of convex programs
- Trust region affine scaling algorithms for linearly constrained convex and concave programs
- A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints
- An implementation of Karmarkar's algorithm for linear programming
- An affine scaling trust-region approach to bound-constrained nonlinear systems
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- A trust region method based on a new affine scaling technique for simple bounded optimization
- A variation on Karmarkar’s algorithm for solving linear programming problems
- A Trust Region Interior Point Algorithm for Linearly Constrained Optimization
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- Partial Affine-Scaling for Linearly Constrained Minimization
- Constraint Reduction for Linear Programs with Many Inequality Constraints
- A trust region method based on interior point techniques for nonlinear programming.
This page was built for publication: A partial first-order affine-scaling method
