Lagrange multipliers theorem and saddle point optimality criteria in mathematical programming
From MaRDI portal
Publication:852755
DOI10.1016/j.jmaa.2005.10.038zbMath1102.90069OpenAlexW2120393601MaRDI QIDQ852755
Lam Hoang Nguyen, Duong Minh Duc, Nguyen Dinh Hoang
Publication date: 15 November 2006
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2005.10.038
Related Items (4)
Characterization results of solutions in interval-valued optimization problems with mixed constraints ⋮ Saddle-point optimality criteria involving (p, b, d)-invexity and (p, b, d)-pseudoinvexity in interval-valued optimisation problems ⋮ Properties of Derivates and Some Applications ⋮ On a modified optimal control problem with first-order PDE constraints and the associated saddle-point optimality criterion
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized differentials of nonsmooth functions, and necessary conditions for an extremum
- A generalized derivative for calm and stable functions
- On incomplete Lagrange function and saddle point optimality criteria in mathematical programming
- An abstract extremal principle with applications to welfare economics
- A Lagrange multiplier rule with small convex-valued subdifferentials for nonsmooth problems of mathematical programming involving equality and nonfunctional constraints
- Multiplier Rules Under Mixed Assumptions of Differentiability and Lipschitz Continuity
- Necessary Conditions in Nonsmooth Optimization
- Shrinking generalized gradients
- Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
- Lagrange Multipliers for Nonconvex Generalized Gradients with Equality, Inequality, and Set Constraints
- Necessary Suboptimality and Optimality Conditions via Variational Principles
- Lagrange multipliers for functions derivable along directions in a linear subspace
- Implicit Functions and Optimization Problems without Continuous Differentiability of the Data
This page was built for publication: Lagrange multipliers theorem and saddle point optimality criteria in mathematical programming
