Variable metric methods for linearly constrained nonlinear minimax approximation
From MaRDI portal
Publication:1051247
DOI10.1007/BF02242138zbMath0514.49016MaRDI QIDQ1051247
Publication date: 1983
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02242138
variable metric methods; nondifferentiable optimization; linearly constrained optimization; nonlinear minimax approximation
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
49M37: Numerical methods based on nonlinear programming
49J35: Existence of solutions for minimax problems
90C99: Mathematical programming
Related Items
A compact variable metric algorithm for nonlinear minimax approximation, Unnamed Item, Unnamed Item, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- A numerically stable form of the simplex algorithm
- Combined lp and quasi-Newton methods for minimax optimization
- Newton-type methods for unconstrained and linearly constrained optimization
- Projection methods for non-linear programming
- Finding the nearest point in A polytope
- Linearly constrained minimax optimization
- Rank-one and Rank-two Corrections to Positive Definite Matrices Expressed in Product Form