Characterizations of optimality in convex programming: the nondifferentiable case

DOI10.1080/00036817908839260MaRDI QIDQ3048158zbMATH OpenOpenAlexWikidataFDO

Authors R. Wolf

Publication date 1979

Published in Applicable Analysis (Search for Journal in Brave)

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

zbMATH Keywords

collectively compact operator approximationcondensing operatorfixed pointfunctional differential equationmeasure of noncompactness

Mathematics Subject Classification ID

Functional-differential equations in abstract spaces (34K30) Fixed-point theorems (47H10) Numerical solutions to equations with nonlinear operators (65J15) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Cites work

• Characterization of optimality in convex programming without a constraint qualification
• Convex Analysis
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• scientific article; zbMATH DE number 3159112 (Why is no real title available?)
• scientific article; zbMATH DE number 3513549 (Why is no real title available?)
• scientific article; zbMATH DE number 3525695 (Why is no real title available?)
• Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
• Necessary and Sufficient Conditions for a Pareto Optimum in Convex Programming

Cited in

(1)

• Existence and approximation of fixed points for multivalued maps

This page was built for publication: Characterizations of optimality in convex programming: the nondifferentiable case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3048158)