Partly convex programming and Zermelo's navigation problems

DOI10.1007/BF01279450zbMath0841.90102MaRDI QIDQ1904650

Sanjo Zlobec

Publication date: 24 July 1996

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

parametric optimizationpartly convex programmingpoint-to-set topologysaddle-point conditionsZermelo's navigation problems

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Nonlinear programming (90C30)

Related Items

Stable parametric programming^* ⋮ Convex Parametric Programming in Abstract Spaces

Cites Work

• Characterizing optimality in mathematical programming models
• A simplified test for optimality
• New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
• A remark on the GOP algorithm for global optimization
• A simple constraint qualification in convex programming
• Handbook of global optimization
• On functions whose local minima are global
• On the method of multipliers for mathematical programming problems
• On Iterated Minimization in Nonconvex Optimization
• Constraint qualifications in input optimisation
• The marginal value formula on regions of stability
• The marginal value formula in input optimization
• A Decomposition Strategy for Global Optimum Search in the Pooling Problem
• On a Method of Weierstraß for the Simultaneous Calculation of the Roots of a Polynomial
• A note on functions whose local minima are global
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item