The Linear Nonconvex Generalized Gradient and Lagrange Multipliers

DOI10.1137/0805033zbMath0829.49017OpenAlexW2056503788MaRDI QIDQ4852586

Jay S. Treiman

Publication date: 8 January 1996

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

Full work available at URL: https://semanticscholar.org/paper/0ccea77e0309bb72e7ecf03bb65537982739cb24

zbMATH Keywords

nonsmooth analysiscoderivativechain rulegeneralized gradientsLagrange multiplier rule

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Related Items (29)

Optimality conditions and duality for interval-valued optimization problems using convexifactors ⋮ Optimality conditions for pessimistic bilevel problems using convexificator ⋮ On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-Jacobians ⋮ Constraint qualifications for nonsmooth mathematical programs with equilibrium constraints ⋮ Necessary optimality conditions in terms of convexificators in Lipschitz optimization ⋮ Convexificators and boundedness of the Kuhn–Tucker multipliers set ⋮ On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity ⋮ Necessary and sufficient optimality conditions for fractional multi-objective problems ⋮ On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential ⋮ Extremal principle based on the linear subdifferential ⋮ Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem ⋮ Necessary optimality conditions for bilevel set optimization problems ⋮ Exact penalization and necessary optimality conditions for multiobjective optimization problems with equilibrium constraints ⋮ Sensitivity analysis of the value function for nonsmooth optimization problems ⋮ Multiobjective Problems: Enhanced Necessary Conditions and New Constraint Qualifications through Convexificators ⋮ Nonsmooth calculus of semismooth functions and maps ⋮ Convexificators and strong Kuhn-Tucker conditions ⋮ Necessary optimality conditions for bilevel optimization problems using convexificators ⋮ Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators ⋮ The linear generalized gradient in infinite dimensions ⋮ Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications ⋮ Nonsmooth multiobjective programming and constraint qualifications ⋮ A new Abadie-type constraint qualification for general optimization problems ⋮ Optimality conditions for multiobjective fractional programming, via convexificators ⋮ Nonsmooth calculus, minimality, and monotonicity of convexificators ⋮ Nonsmooth analysis on smooth manifolds ⋮ Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators ⋮ Optimality and duality for nonsmooth minimax programming problems using convexifactor ⋮ Optimality conditions for nonsmooth semidefinite programming via convexificators

This page was built for publication: The Linear Nonconvex Generalized Gradient and Lagrange Multipliers