Variable metric methods for linearly constrained nonlinear minimax approximation

DOI10.1007/BF02242138zbMath0514.49016OpenAlexW406762770MaRDI QIDQ1051247

Ladislav Lukšan

Publication date: 1983

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02242138

zbMATH Keywords

variable metric methodsnondifferentiable optimizationlinearly constrained optimizationnonlinear minimax approximation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Existence of solutions for minimax problems (49J35) Mathematical programming (90C99)

Related Items (4)

Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A compact variable metric algorithm for nonlinear minimax approximation

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

This page was built for publication: Variable metric methods for linearly constrained nonlinear minimax approximation