On the Fritz John saddle point problem for differentiable multiobjective optimization

DOI10.1007/S12597-016-0253-XMaRDI QIDQ522444zbMATH OpenOpenAlexFDO

Authors G. N. Sottosanto, María Cristina Maciel, S. A. Santos

Publication date 28 April 2017

Published in Opsearch (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12597-016-0253-x

zbMATH Keywords

multiobjective optimizationsaddle pointsfritz John points

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Lagrange multipliers and saddle points in multiobjective programming
• Fritz John's type conditions and associated duality forms in convex non differentiable vector-optimization
• scientific article; zbMATH DE number 2159098
• Duality theorem of nondifferentiable convex multiobjective programming
• Saddle point and generalized convex duality for multiobjective programming.

Cites work

• scientific article; zbMATH DE number 417962 (Why is no real title available?)
• scientific article; zbMATH DE number 3902413 (Why is no real title available?)
• scientific article; zbMATH DE number 734930 (Why is no real title available?)
• scientific article; zbMATH DE number 1539025 (Why is no real title available?)
• scientific article; zbMATH DE number 1568980 (Why is no real title available?)
• scientific article; zbMATH DE number 3067835 (Why is no real title available?)
• A MULTI-OBJECTIVE SENSITIVITY APPROACH TO TRAINING PROVIDERS' EVALUATION AND QUOTA ALLOCATION PLANNING
• A critical view on invexity
• A sufficient condition for invexity
• An optimization modelling for string selection in molecular biology using Pareto optimality
• Constrained qualifications in multiobjective optimization problems: Differentiable case
• Duality in Vector Optimization
• Duality theory in multiobjective programming
• Efficiency and generalized convex duality for nondifferentiable multiobjective programs
• Generalized convexity in multiobjective programming
• Invex functions and constrained local minima
• Invex functions and generalized convexity in multiobjective programming
• Invexity and optimization
• Multiobjective programming under \((\varphi,d)\)-V-type I univexity
• Necessary and sufficient second order optimality conditions for multiobjective problems with \(C^1\) data
• On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
• On duality theory in multiobjective programming
• On invexity-type nonlinear programming problems
• On second-order optimality conditions for vector optimization
• On second-order optimality conditions for vector optimization: Addendum
• On sufficiency of the Kuhn-Tucker conditions
• On the optimality of some classes of invex problems
• On weak and strong Kuhn-Tucker conditions for smooth multiobjective optimization
• Pareto optimality, game theory and equilibria
• Proper efficiency and the theory of vector maximization
• Pseudo-Convex Functions
• Regularity conditions in differentiable vector optimization revisited
• Regularity conditions in vector optimization
• The essence of invexity
• Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
• Vector Optimization
• What is invexity with respect to the same \(\eta\)?
• What is invexity?

Cited in

(1)

• Criteria of saddle points for the general form of vector optimization problem in complex space

This page was built for publication: On the Fritz John saddle point problem for differentiable multiobjective optimization

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