On the Fritz John saddle point problem for differentiable multiobjective optimization

DOI10.1007/S12597-016-0253-XzbMATH Open1360.90235OpenAlexW2339695104MaRDI QIDQ522444FDOQ522444

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

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.

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)

Cites Work

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

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)