Characterizations of optimality in convex programming: the nondifferentiable case

DOI10.1080/00036817908839260zbMath0413.65045OpenAlexW2049473968WikidataQ58293720 ScholiaQ58293720MaRDI QIDQ3048158

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

fixed pointmeasure of noncompactnessfunctional differential equationcondensing operatorcollectively compact operator approximation

Mathematics Subject Classification ID

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

Related Items (1)

Existence and approximation of fixed points for multivalued maps

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of optimality in convex programming without a constraint qualification
• 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
• Convex Analysis
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development

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