A Structure-Exploiting Algorithm for Nonlinear Minimax Problems

DOI10.1137/0802013zbMath0755.41030OpenAlexW1994772893MaRDI QIDQ4018393

Andrew R. Conn, Yuying Li

Publication date: 16 January 1993

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0802013

zbMATH Keywords

nonlinear minimax problemsbest linear Chebyshev approximation

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Best approximation, Chebyshev systems (41A50) Numerical approximation and computational geometry (primarily algorithms) (65D99)

Related Items (6)

A Unified Study of Necessary and Sufficient Optimality Conditions for Minimax and Chebyshev Problems with Cone Constraints ⋮ Algorithms with adaptive smoothing for finite minimax problems ⋮ Discontinuous piecewise linear optimization ⋮ The continuous quadrant penalty formulation of logical constraints ⋮ Solving linear programming problems via linear minimax problems ⋮ Computational aspects of general minimax optimization

This page was built for publication: A Structure-Exploiting Algorithm for Nonlinear Minimax Problems