A Lagrange multiplier rule with small convex-valued subdifferentials for nonsmooth problems of mathematical programming involving equality and nonfunctional constraints
From MaRDI portal
Publication:1803619
DOI10.1007/BF01581262zbMATH Open0782.90095MaRDI QIDQ1803619FDOQ1803619
Authors: Alexander D. Ioffe
Publication date: 29 June 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
- A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
- scientific article; zbMATH DE number 1383183
- Lagrange Multipliers for Nonconvex Generalized Gradients with Equality, Inequality, and Set Constraints
- Revisiting the Lagrange multiplier rule
- SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS
controllabilityLagrange multiplier ruleLipschitz continuousfansMichel-Penot subdifferentialsweak prederivative of a Lipschitz map
Cites Work
- Optimization and nonsmooth analysis
- Nonsmooth Analysis: Differential Calculus of Nondifferentiable Mappings
- Title not available (Why is that?)
- Shrinking generalized gradients
- Approximate Subdifferentials and Applications. I: The Finite Dimensional Theory
- Necessary Conditions in Nonsmooth Optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Adjoint differential inclusions in necessary conditions for the minimal trajectories of differential inclusions
Cited In (31)
- A Pontryagin maximum principle in Wasserstein spaces for constrained optimal control problems
- The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
- The principle of Lagrange and critical values of optimization problems
- \(E\)-subdifferential of \(E\)-convex functions and its applications to minimization problem
- On optimality conditions and duality for multiobjective optimization with equilibrium constraints
- KKT conditions for weak\(^\ast\) compact convex sets, theorems of the alternative, and optimality conditions
- Exhausters, optimality conditions and related problems
- Necessary conditions for efficiency in terms of the Michel--Penot subdifferentials
- Lagrange multipliers theorem and saddle point optimality criteria in mathematical programming
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- Necessary optimality conditions in discrete nonsmooth optimal control
- Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- Finite-dimensional approximations in the derivation of necessary optimality conditions in nonsmooth constrained optimal control
- A new constraint qualification and sharp optimality conditions for nonsmooth mathematical programming problems in terms of quasidifferentials
- Constraint qualifications in nonsmooth optimization: Classification and inter-relations
- New approximation method in the proof of the Maximum Principle for nonsmooth optimal control problems with state constraints
- Necessary optimality conditions in non-smooth problems with equality constraints
- Boundedness of certain sets of Lagrange multipliers in vector optimization
- The linear generalized gradient in infinite dimensions
- Nonsmooth optimization
- Small convex-valued subdifferentials in mathematical programming
- Exhausters and subdifferentials in non-smooth analysis
- The conditions of minimum for a smooth function on the boundary of a quasidifferntiable set
- Optimality conditions for non-smooth semi-infinite programming
- On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming
- Metric regularity of quasidifferentiable mappings and optimality conditions for nonsmooth mathematical programming problems
- SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS
- Constraint qualifications for nonsmooth mathematical programs with equilibrium constraints
- Revisiting the Lagrange multiplier rule
- A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
This page was built for publication: A Lagrange multiplier rule with small convex-valued subdifferentials for nonsmooth problems of mathematical programming involving equality and nonfunctional constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803619)