Partly convex programming and Zermelo's navigation problems
type: Item
instance of: scholarly article
title: Partly convex programming and Zermelo's navigation problems
zbMATH Open document ID: 0841.90102
DOI: 10.1007/BF01279450
published in: Journal of Global Optimization
publication date: 1996-07-24T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 829911
zbMATH Keywords: partly convex programming
zbMATH Keywords: saddle-point conditions
zbMATH Keywords: parametric optimization
zbMATH Keywords: point-to-set topology
zbMATH Keywords: Zermelo's navigation problems
author: Sanjo Zlobec
MaRDI profile type: Publication
cites work: A simplified test for optimality
cites work: Q3968042
cites work: Q3902815
cites work: A Decomposition Strategy for Global Optimum Search in the Pooling Problem
cites work: On a Method of Weierstraß for the Simultaneous Calculation of the Roots of a Polynomial
cites work: Handbook of global optimization
cites work: On Iterated Minimization in Nonconvex Optimization
cites work: A remark on the GOP algorithm for global optimization
cites work: On the method of multipliers for mathematical programming problems
cites work: Q4401514
cites work: Q3348722
cites work: The marginal value formula on regions of stability
cites work: Constraint qualifications in input optimisation
cites work: New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
cites work: Q3945116
cites work: On functions whose local minima are global
cites work: A note on functions whose local minima are global
cites work: A simple constraint qualification in convex programming
cites work: Characterizing optimality in mathematical programming models
cites work: The marginal value formula in input optimization
cites work: Q3991498
description: scientific article; zbMATH DE number 829911