Characterizing FJ and KKT Conditions in Nonconvex Mathematical Programming with Applications

DOI10.1137/13094606XzbMath1398.90126OpenAlexW2026957037MaRDI QIDQ2954393

Giandomenico Mastroeni, Fabián Flores-Bazan

Publication date: 13 January 2017

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/13094606x

zbMATH Keywords

Karush-Kuhn-Tucker conditionsparametric optimization problemvector equilibrium problemFritz John conditionquasi-variational inequality problemmathematical program with equilibrium type constraints

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31)

Related Items (8)

First- and second-order optimality conditions for quadratically constrained quadratic programming problems ⋮ Constrained extremum problems, regularity conditions and image space analysis. I: The scalar finite-dimensional case ⋮ Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle ⋮ DC auxiliary principle methods for solving lexicographic equilibrium problems ⋮ On second-order Fritz John type optimality conditions for a class of differentiable optimization problems ⋮ On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization ⋮ On gap functions for nonsmooth multiobjective optimization problems ⋮ Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enhanced Karush-Kuhn-Tucker condition and weaker constraint qualifications
• Fritz John necessary optimality conditions of the alternative-type
• A complete characterization of strong duality in nonconvex optimization with a single constraint
• A relaxed constant positive linear dependence constraint qualification and applications
• On general minimax theorems
• Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
• An optimal alternative theorem and applications to mathematical programming
• Semidifferentiable functions and necessary optimality conditions
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• An extended descent framework for variational inequalities
• Existence theory for finite-dimensional pseudomonotone equilibrium problems
• Lagrange-type functions in constrained non-convex optimization.
• Theorems of the alternative and optimality conditions
• Pseudonormality and a Lagrange multiplier theory for constrained optimization
• Solving quasi-variational inequalities via their KKT conditions
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Necessary optimality criteria in mathematical programming in the presence of differentiability
• On M-stationary points for mathematical programs with equilibrium constraints
• Gordan-Type Alternative Theorems and Vector Optimization Revisited
• Optimality Conditions via Exact Penalty Functions
• Calmness and Exact Penalization
• Optimization and nonsmooth analysis
• A New Approach to Lagrange Multipliers
• Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
• Geometry of optimality conditions and constraint qualifications
• Two New Weak Constraint Qualifications and Applications
• Strong Duality in Cone Constrained Nonconvex Optimization
• Constraint qualifications in maximization problems
• Lagrange Multipliers and Calmness Conditions of Order p
• Enhanced Fritz John Conditions for Convex Programming
• Nonlinear Programming
• Nonlinear Programming in Banach Space
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• Convex Analysis
• A Necessary and Sufficient Qualification for Constrained Optimization

This page was built for publication: Characterizing FJ and KKT Conditions in Nonconvex Mathematical Programming with Applications