eCommons

 

An Efficient Algorithm for Nonlinear Minimax Problems

Other Titles

Abstract

We present a new method for solving a nonlinear minimax problem. This new algorithm exploits the structure and characterisation of the solution whenever possible. The exploitation is based on the results that have been established in [13]. The algorithm is globally convergent with a superlinear convergence rate. Numerical results indicate the efficacy of the new method.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1990-03

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR90-1104

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record