Complete characterization of optimality for convex programming in banach spaces†

DOI10.1080/00036818008839319zbMath0445.90095OpenAlexW2080969070WikidataQ58298696 ScholiaQ58298696MaRDI QIDQ3890447

Sanjo Zlobec, Bruce D.Craven

Publication date: 1980

Published in: Applicable Analysis (Search for Journal in Brave)

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

zbMATH Keywords

optimality conditionsduality theoremPontryagin's principleprogramming in Banach spacesoptimal control of a convex systemrelative radial pointweak geometrical assumption

Mathematics Subject Classification ID

Convex programming (90C25) Normed linear spaces and Banach spaces; Banach lattices (46B99) Programming in abstract spaces (90C48)

Related Items

On optimality in abstract convex programming, A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential, Asymptotic dual conditions characterizing optimality for infinite convex programs, On minimization subject to cone constraints, Generalized convexity in nondifferentiable programming, Perturbed convex programming in reflexive Banach spaces, An extension lemma and homogeneous programming, A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes, Variational inequalities with cone constraints, Asymptotic kuhn-tucker conditions in abstract spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of optimality in convex programming without a constraint qualification
• A simplified test for optimality
• The saddle point theorem of Kuhn and Tucker in ordered vector spaces
• Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
• Nonlinear programming in locally convex spaces
• A duality theorem for non-linear programming
• Various definitions of the derivative in mathematical programming
• Sufficient Fritz John optimality conditions
• Primal Geometric Programs Treated by Linear Programming
• A note on Fritz John sufficiency
• On A characterization of optimality in convex programming
• Sufficient Fritz John optimality conditions for nondifferentiable convex programming
• Lagrangean conditions and quasiduality
• Existence theorems for Pareto optimization in Banach spaces
• Necessary and Sufficient Conditions for a Pareto Optimum in Convex Programming
• Extensions of Asymptotic Kuhn–Tucker Conditions in Mathematical Programming
• Sufficient Conditions for the Optimal Control of Nonlinear Systems
• Nonlinear Programming in Banach Space
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• Transposition Theorems for Cone-Convex Functions