A compact variable metric algorithm for nonlinear minimax approximation

DOI10.1007/BF02240210zbMath0573.90077OpenAlexW291295066MaRDI QIDQ1062915

Ladislav Lukšan

Publication date: 1986

Published in: Computing (Search for Journal in Brave)

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

zbMATH Keywords

variable metric methodnonlinear minimax approximationinverse Hessian matrix of the Lagrangian function

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)

Related Items (7)

A modified SQP algorithm for minimax problems ⋮ A sequential quadratic programming algorithm for nonlinear minimax problems ⋮ A hybrid algorithm for linearly constrained minimax problems ⋮ A hybrid algorithm for nonlinear minimax problems ⋮ Unnamed Item ⋮ Globally convergent variable metric method for convex nonsmooth unconstrained minimization ⋮ A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem

Cites Work

• Variable metric methods for linearly constrained nonlinear minimax approximation
• 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
• Finding the nearest point in A polytope
• An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations
• Matrix conditioning and nonlinear optimization
• The Convergence of a Class of Double-rank Minimization Algorithms

This page was built for publication: A compact variable metric algorithm for nonlinear minimax approximation