A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints

DOI10.1137/S1052623499354540zbMath1047.90075OpenAlexW1971509769MaRDI QIDQ4509755

Publication date: 19 October 2000

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

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

zbMATH Keywords

nonsmooth analysis equality constraints minimax problems generalized Jacobians sharp Lagrange mutipliers

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Optimality conditions for minimax problems (49K35)

Related Items (25)

Optimality conditions and duality for interval-valued optimization problems using convexifactors ⋮ Necessary optimality conditions in terms of convexificators in Lipschitz optimization ⋮ Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case ⋮ Convexificators and boundedness of the Kuhn–Tucker multipliers set ⋮ First and second order optimality conditions using approximations for nonsmooth vector optimization in Banach spaces ⋮ Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators ⋮ On constraint qualifications in terms of approximate Jacobians for nonsmooth continuous optimization problems ⋮ Metric regularity of quasidifferentiable mappings and optimality conditions for nonsmooth mathematical programming problems ⋮ Local uniqueness of solutions of general variational inequalities ⋮ Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators ⋮ A multiplier rule on a metric space ⋮ Convexifactors, generalized convexity and vector optimization ⋮ Convexificators and strong Kuhn-Tucker conditions ⋮ Convexifactors, generalized convexity, and optimality conditions ⋮ Chain rules for approximate Jacobians of continuous functions ⋮ Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization ⋮ Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators ⋮ Solution point characterizations and convergence analysis of a descent algorithm for nonsmooth continuous complementarity problems. ⋮ A New Constraint Qualification and Sharp Optimality Conditions for Nonsmooth Mathematical Programming Problems in Terms of Quasidifferentials ⋮ Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications ⋮ Second order optimality conditions for a bilevel optimization problem in terms of approximate Hessians ⋮ A set-valued Lagrange theorem based on a process for convex vector programming ⋮ Nonsmooth multiobjective programming and constraint qualifications ⋮ Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators ⋮ The Fréchet approximate Jacobian and local uniqueness in variational inequalities

This page was built for publication: A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints