The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
From MaRDI portal
Recommendations
- Lagrange Multipliers for Nonconvex Generalized Gradients with Equality, Inequality, and Set Constraints
- A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
- A Lagrange multiplier rule with small convex-valued subdifferentials for nonsmooth problems of mathematical programming involving equality and nonfunctional constraints
- Lagrange Multipliers and Optimality
- Characterizing the Lagrange multiplier rule in nonconvex set-valued optimization
Cited in
(39)- Nonsmooth calculus, minimality, and monotonicity of convexificators
- On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-Jacobians
- Exact penalization and necessary optimality conditions for multiobjective optimization problems with equilibrium constraints
- Sensitivity analysis of the value function for nonsmooth optimization problems
- Nonsmooth calculus of semismooth functions and maps
- Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications
- Optimality conditions for nonsmooth semidefinite programming via convexificators
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- Necessary optimality conditions for bilevel optimization problems using convexificators
- On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity
- Optimality conditions and duality for interval-valued optimization problems using convexifactors
- Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
- Nonsmooth multiobjective programming and constraint qualifications
- On the pseudo-monotonicity of generalized gradients of nonconvex functions
- Nonsmooth analysis on smooth manifolds
- Necessary and sufficient optimality conditions for fractional multi-objective problems
- Extremal principle based on the linear subdifferential
- Convexificators and boundedness of the Kuhn-Tucker multipliers set
- Multiobjective problems: enhanced necessary conditions and new constraint qualifications through convexificators
- Lagrange Multipliers for Nonconvex Generalized Gradients with Equality, Inequality, and Set Constraints
- scientific article; zbMATH DE number 880246 (Why is no real title available?)
- Optimality and duality for nonsmooth minimax programming problems using convexifactor
- Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem
- Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using \(\varepsilon\)-upper semi-regular semi-convexificators
- The linear generalized gradient in infinite dimensions
- On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential
- Second-order necessary and sufficient efficiency conditions for nonsmooth semi-infinite multiobjective optimization problems
- On approximate strong KKT points of nonsmooth interval-valued mutiobjective optimization problems using convexificators
- Optimality analysis for \(\epsilon\)-quasi solutions of optimization problems via \(\epsilon\)-upper convexificators: a dual approach
- First and second order optimality conditions for nonsmooth multiobjective problems with equilibrium constraints
- Convexificators and strong Kuhn-Tucker conditions
- Convexificators for nonconvex multiobjective optimization problems with uncertain data: robust optimality and duality
- Optimality conditions for a class of nonsmooth semidefinite bilevel optimization problems via convexifications applied to bilevel supply chain under uncertainty
- Efficiency conditions for nonsmooth vector equilibrium problems with constraints via generalized subdifferentials
- A new Abadie-type constraint qualification for general optimization problems
- Optimality conditions for multiobjective fractional programming, via convexificators
- Optimality conditions for pessimistic bilevel problems using convexificator
- Constraint qualifications for nonsmooth mathematical programs with equilibrium constraints
- Necessary optimality conditions for bilevel set optimization problems
This page was built for publication: The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4852586)
