Constraint qualification in a general class of Lipschitzian mathematical programming problems
From MaRDI portal
Publication:2465488
DOI10.1007/S10898-006-9101-5zbMATH Open1145.90101OpenAlexW2067640900MaRDI QIDQ2465488FDOQ2465488
Authors: Zi-Shuang Tong, X. J. Zheng
Publication date: 4 January 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9101-5
Recommendations
- Constraint qualifications for constrained Lipschitz optimization problems and applications to a MPCC
- Constraint qualification in a general class of nondifferentiable mathematical programming problems
- Constraint qualifications in a class of nondifferentiable mathematical programming problems
- A constraint qualification for convex programming
- A class of constraint qualifications in nonsmooth optimization
- Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
- General constraint qualifications in nondifferentiable programming
- On constraint qualifications in nonlinear programming
- Lipschitz properties of solutions in mathematical programming
- A constraint qualification in quasidifferentiable programming
Cites Work
- Convex Analysis
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- A class of nondifferentiable mathematical programming problems
- Necessary and sufficient conditions for minimax fractional programming
- Optimality conditions for fractional minmax programming
- Constraint qualifications in a class of nondifferentiable mathematical programming problems
Cited In (7)
- General constraint qualifications in nondifferentiable programming
- Constraint qualifications in nonsmooth optimization: Classification and inter-relations
- Constraint qualifications in a class of nondifferentiable mathematical programming problems
- Constraint qualification in a general class of nondifferentiable mathematical programming problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constraint qualifications for KKT optimality condition in convex optimization with locally Lipschitz inequality constraints
This page was built for publication: Constraint qualification in a general class of Lipschitzian mathematical programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465488)