An ODE-based approach to nonlinearly constrained minimax problems

DOI10.1007/BF02143925zbMath0824.65039OpenAlexW2054496646MaRDI QIDQ1893526

Edwin H. jun. Kaufman, G. D. (Jerry) Taylor, David J. Leeming

Publication date: 4 July 1995

Published in: Numerical Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

algorithmiterationnonlinear programmingline searchnonlinearly constrained minimax problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (2)

Topology Optimization of the Caudal Fin of the Three-Dimensional Self-Propelled Swimming Fish ⋮ CONMAX

Cites Work

• Unnamed Item
• Unnamed Item
• More test examples for nonlinear programming codes
• Approximation and interpolation by convexity-preserving rational splines
• Finding the nearest point in A polytope

This page was built for publication: An ODE-based approach to nonlinearly constrained minimax problems