Corrected sequential linear programming for sparse minimax optimization
From MaRDI portal
Publication:1338528
DOI10.1007/BF01935647zbMath0813.65090MaRDI QIDQ1338528
Publication date: 7 June 1995
Published in: BIT (Search for Journal in Brave)
algorithmglobal convergencecomputational experimentssequential linear programminglarge scale nonlinear minimax problemnonlinear inequality constrained optimization
Related Items
Corrected sequential linear programming for sparse minimax optimization, Unnamed Item, Approximation in normed linear spaces, A projected conjugate gradient method for sparse minimax problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A sparse sequential quadratic programming algorithm
- On the augmented system approach to sparse least-squares problems
- Test examples for nonlinear programming codes
- Partitioned variable metric updates for large structured optimization problems
- Resolving degeneracy in quadratic programming
- Corrected sequential linear programming for sparse minimax optimization
- The design of FIR filters in the complex plane by convex optimization
- Nonlinear programming and nonsmooth optimization by successive linear programming
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Optimization and nonsmooth analysis
- An Improved Successive Linear Programming Algorithm
- Variable metric methods for minimizing a class of nondifferentiable functions
- Combined lp and quasi-Newton methods for minimax optimization
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- A model algorithm for composite nondifferentiable optimization problems
- A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
- An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations
- Linearly constrained minimax optimization
- The Minimax Solution of an Overdetermined System of Non-linear Equations
- CUTE
