Complete characterization of optimality for convex programming in banach spaces†
From MaRDI portal
Publication:3890447
Cites work
- A duality theorem for non-linear programming
- A note on Fritz John sufficiency
- A simplified test for optimality
- Characterization of optimality in convex programming without a constraint qualification
- Existence theorems for Pareto optimization in Banach spaces
- Extensions of Asymptotic Kuhn–Tucker Conditions in Mathematical Programming
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- scientific article; zbMATH DE number 3664752 (Why is no real title available?)
- scientific article; zbMATH DE number 3672000 (Why is no real title available?)
- scientific article; zbMATH DE number 3698734 (Why is no real title available?)
- scientific article; zbMATH DE number 3726082 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 3505708 (Why is no real title available?)
- scientific article; zbMATH DE number 3609480 (Why is no real title available?)
- scientific article; zbMATH DE number 3621473 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- scientific article; zbMATH DE number 3397318 (Why is no real title available?)
- scientific article; zbMATH DE number 3399051 (Why is no real title available?)
- scientific article; zbMATH DE number 3052220 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- Lagrangean conditions and quasiduality
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- Necessary and Sufficient Conditions for a Pareto Optimum in Convex Programming
- Nonlinear Programming in Banach Space
- Nonlinear programming in locally convex spaces
- On A characterization of optimality in convex programming
- Primal Geometric Programs Treated by Linear Programming
- Sufficient Conditions for the Optimal Control of Nonlinear Systems
- Sufficient Fritz John optimality conditions
- Sufficient Fritz John optimality conditions for nondifferentiable convex programming
- The saddle point theorem of Kuhn and Tucker in ordered vector spaces
- Transposition Theorems for Cone-Convex Functions
- Various definitions of the derivative in mathematical programming
Cited in
(10)- Variational inequalities with cone constraints
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
- On minimization subject to cone constraints
- Generalized convexity in nondifferentiable programming
- Perturbed convex programming in reflexive Banach spaces
- Asymptotic kuhn-tucker conditions in abstract spaces
- On optimality in abstract convex programming
- A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential
- An extension lemma and homogeneous programming
This page was built for publication: Complete characterization of optimality for convex programming in banach spaces†
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3890447)