Characterization of optimal solutions for nonlinear programming problems with conic constraints
From MaRDI portal
Recommendations
- Characterization of weakly efficient solutions for nonlinear multiobjective programming problems. Duality
- Generalized convexity for non-regular optimization problems with conic constraints
- Generalized convexity in non-regular programming problems with inequality-type constraints
- Generalized invexity-type conditions in constrained optimization
- Generalized convexity in multiobjective programming
Cites work
- Invex functions and constrained local minima
- Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
- On sufficiency of the Kuhn-Tucker conditions
- Regularity and stability for the mathematical programming problem in Banach spaces
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- The essence of invexity
Cited in
(5)- New optimality conditions for nonsmooth control problems
- Generalized convexity in non-regular programming problems with inequality-type constraints
- Characterizations of solution sets of cone-constrained convex programming problems
- Generalized convexity for non-regular optimization problems with conic constraints
- Characterization of weakly efficient solutions for nonlinear multiobjective programming problems. Duality
This page was built for publication: Characterization of optimal solutions for nonlinear programming problems with conic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093087)