Optimization theory in linear spaces. III: Mathematical programming in partially ordered Banach spaces
From MaRDI portal
Publication:2536724
DOI10.1007/BF01350314zbMATH Open0186.18203MaRDI QIDQ2536724FDOQ2536724
Authors: Yanyan Li
Publication date: 1970
Published in: Mathematische Annalen (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/161915
Cites Work
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pseudo-Convex Functions
- GENERAL NECESSARY CONDITIONS FOR OPTIMIZATION PROBLEMS
- An Abstract Variational Theory with Applications to a Broad Class of Optimization Problems. I. General Theory
- Duality for Nonlinear Programming in a Banach Space
- Optimization theory in linear spaces. II: On systems of linear operator inequalities in partially ordered normed linear spaces
- Optimization theory in linear spaces. I
- The Kuhn-Tucker conditions in Banach space with an application to control theory
Cited In (22)
- Dual nonlinear programming problems in partially ordered Banach spaces
- Geometric consideration of duality in vector optimization
- On optimality conditions for maximizations with respect to cones
- On duality for weakly minimized vector valued optimization problems
- General Lagrange multiplier theorems
- Subdifferential calculus for convex operators
- A survey of vector optimization in infinite-dimensional spaces. II
- Duality for nonlinear multiple-criteria optimization problems
- Modified regularity conditions for nonlinear programming problems over mixed cone domains
- Optimization in Banach spaces
- Optimality conditions in nonconical multiple objective programming
- Local convex analysis
- When the Karush-Kuhn-Tucker theorem fails: constraint qualifications and higher-order optimality conditions for degenerate optimization problems
- An elementary proof of the Karush-Kuhn-Tucker theorem in normed linear spaces for problems with a finite number of inequality constraints
- Duality theory for maximizations with respect to cones
- Conditions for constrained efficient solutions of multiobjective problems in Banach spaces
- A duality theorem for a convex programming problem in order complete vector lattices
- Optimality conditions and constraint qualifications in Banach space
- On the existence and nonexistence of Lagrange multipliers in Banach spaces
- The saddle point theorem of Kuhn and Tucker in ordered vector spaces
- A selection principle with applications in convex analysis and optimization
- Geometry of optimality conditions and constraint qualifications
This page was built for publication: Optimization theory in linear spaces. III: Mathematical programming in partially ordered Banach spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2536724)