Nonsmooth Mathematical Programs with Vanishing Constraints in Banach Spaces
DOI10.1007/978-3-031-00832-0_13zbMATH Open1527.90224MaRDI QIDQ6487244FDOQ6487244
Authors: Vivek Laha, Vinay Singh, Yogendra Pandey, S. K. Mishra
Publication date: 7 October 2022
Recommendations
- Some non-smooth optimality results for optimization problems with vanishing constraints via Dini-Hadamard derivative
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Programming in abstract spaces (90C48)
Cites Work
- Numerical Optimization
- Convex Analysis
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Title not available (Why is that?)
- Optimization and nonsmooth analysis
- A Generalized Mathematical Program with Equilibrium Constraints
- Title not available (Why is that?)
- A generalized derivative for calm and stable functions
- Necessary conditions in nonsmooth minimization via lower and upper subgradients
- Active-set Newton methods for mathematical programs with vanishing constraints
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- Necessary and sufficient conditions for M-stationarity of nonsmooth optimization problems with vanishing constraints
- Mathematical Programs with Equilibrium Constraints
- Nonsmooth analysis
- Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
- Existence of minimizers and necessary conditions in set-valued optimization with equilibrium constraints.
- On constraint qualifications in nonsmooth optimization.
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Generalized convexity and optimization. Theory and applications
- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
- On M-stationary points for mathematical programs with equilibrium constraints
- Multiplier rules under mixed assumptions of differentiability and Lipschitz continuity
- Optimality conditions and Newton-type methods for mathematical programs with vanishing constraints
- On duality for mathematical programs with vanishing constraints
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Nondifferentiable multiplier rules for optimization problems with equilibrium constraints
- Exact penalty results for mathematical programs with vanishing constraints
- Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
- Foundations of optimization
- Title not available (Why is that?)
- On the cones of tangents with applications to mathematical programming
- A Necessary and Sufficient Qualification for Constrained Optimization
- On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints
- Suboptimality conditions for mathematical programs with equilibrium constraints
- A nonsmooth variant of the Mangasarian-Fromovitz constraint qualification
- Title not available (Why is that?)
- Semiregularity and Generalized Subdifferentials with Applications to Optimization
- Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints
- On constraint qualifications for multiobjective optimization problems with vanishing constraints
- New dualities for mathematical programs with vanishing constraints
- Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints
- The characterization of efficiency and saddle point criteria for multiobjective optimization problem with vanishing constraints
Cited In (2)
This page was built for publication: Nonsmooth Mathematical Programs with Vanishing Constraints in Banach Spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487244)