Optimization by level set methods. III: Characterizations of solutions in the presence of duality

DOI10.1080/01630568208816110zbMath0496.49014OpenAlexW2013603708MaRDI QIDQ3961392

Ivan Singer

Publication date: 1982

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630568208816110

zbMATH Keywords

level setsduality methods

Mathematics Subject Classification ID

Convex programming (90C25) Programming in abstract spaces (90C48) General theory of locally convex spaces (46A03) Duality theory for topological vector spaces (46A20) Methods of successive quadratic programming type (90C55) Optimality conditions for problems in abstract spaces (49K27)

Related Items (6)

A general theory of surrogate dual and perturbational extended surrogate dual optimization problems ⋮ Level sets and the minimal time function of linear control processes ⋮ Abstract subdifferentials and some characterizations of optimal solutions ⋮ Surrogate duality for vector optimization ⋮ Optimization by level set methods vi:generalizations of surrogate type reverse convex duality ⋮ Best approximation and optimization

Cites Work

• Generalizations of methods of best approximation to convex optimization in locally convex spaces. II: hyperbolic theorems

This page was built for publication: Optimization by level set methods. III: Characterizations of solutions in the presence of duality