A sufficient and necessary condition for nonconvex constrained optimization
From MaRDI portal
Publication:1376773
Recommendations
Cites work
Cited in
(17)- scientific article; zbMATH DE number 4041659 (Why is no real title available?)
- Extended Lagrange and penalty functions in optimization
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- scientific article; zbMATH DE number 6400750 (Why is no real title available?)
- Efficiency and approachability of nonconvex bicriteria programs
- An optimality condition for a nondifferentiable convex program
- Necessary optimality conditions for nonconvex differential inclusions with endpoint constraints
- Extended Lagrange And Penalty Functions in Continuous Optimization*
- Value-estimation function method for constrained global optimization
- Nonlinear Lagrangian theory for nonconvex optimization.
- A nonlinear Lagrangian dual for integer programming
- A semistrong sufficiency condition for optimality in nonconvex programming and its connection to the perturbation problem
- A necessary and sufficient condition for minimizing a convex Fréchet differentiable function on a certain hyperplane.
- A necessary optimality condition for nondifferentiable constrained extremum problems
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- On nonconvex optimization
- Modified Lagrangian and least root approaches for general nonlinear optimization problems
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)
