A sufficient and necessary condition for nonconvex constrained optimization
From MaRDI portal
Publication:1376773
DOI10.1016/S0893-9659(97)00075-XzbMATH Open0893.90142MaRDI QIDQ1376773FDOQ1376773
Authors: C. J. Goh, Xiao Qi Yang 
Publication date: 3 August 1998
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Recommendations
nonconvex optimizationconstrained optimizationoptimality conditionsinequality constraintsTchebyshev norm
Cites Work
Cited In (17)
- A semistrong sufficiency condition for optimality in nonconvex programming and its connection to the perturbation problem
- On nonconvex optimization
- Title not available (Why is that?)
- Nonlinear Lagrangian theory for nonconvex optimization.
- A necessary optimality condition for nondifferentiable constrained extremum problems
- Extended Lagrange and penalty functions in optimization
- Extended Lagrange And Penalty Functions in Continuous Optimization*
- Necessary optimality conditions for nonconvex differential inclusions with endpoint constraints
- Efficiency and approachability of nonconvex bicriteria programs
- A nonlinear Lagrangian dual for integer programming
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- Modified Lagrangian and least root approaches for general nonlinear optimization problems
- Value-estimation function method for constrained global optimization
- A necessary and sufficient condition for minimizing a convex Fréchet differentiable function on a certain hyperplane.
- Title not available (Why is that?)
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- An optimality condition for a nondifferentiable convex program
Uses Software
This page was built for publication: A sufficient and necessary condition for nonconvex constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376773)
