go-v.orgdoi

A Structure-Exploiting Algorithm for Nonlinear Minimax Problems

Andrew R. Conn, Yuying Li · SIAM Journal on Optimization · 1992

  • DOI 10.1137/0802013
  • Publisher Society for Industrial and Applied Mathematics
  • Type article
  • Issued 1992

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

SIAM Journal on Optimization · Society for Industrial and Applied Mathematics · article · 1992

Abstract

In this paper, some basic concepts are generalised which characterise the best linear Chebyshev approximation in one variable to general nonlinear minimax problems. A new method for solving a nonlinear minimax problem is presented, which exploits the structure and characterisation of the solution whenever possible. The algorithm is globally convergent with a superlinear convergence rate. Numerical results indicate the efficacy of the new method.

Open the resolved locator · 10.1137/0802013

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-20 18:40 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
https://doi.org/10.1137/0802013
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.