An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
From MaRDI portal
Publication:4292664
Recommendations
- Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
- Karush-Kuhn-Tucker optimality conditions and duality for semi-infinite programming problems with vanishing constraints
- Necessary and sufficient conditions for qualitative properties of infinite dimensional linear programming problems
- On sufficiency of the Kuhn-Tucker conditions in nondifferentiable programming
- Optimality conditions for nonlinear infinite programming problems
- scientific article; zbMATH DE number 13147
- Necessary conditions and duality for inexact nonlinear semi-infinite programming problems
- scientific article; zbMATH DE number 409473
- Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints
Cited in
(18)- On feasible sets defined through Chebyshev approximation
- Duality and liquidity constraints under uncertainty
- Effective method for constrained minimum - reverse bridge theorem
- On Proper Efficiency in Multiobjective Semi-infinite Optimization
- Constraint qualifications in convex vector semi-infinite optimization
- Convex Parametric Programming in Abstract Spaces
- Optimality conditions for nonlinear infinite programming problems
- scientific article; zbMATH DE number 7400725 (Why is no real title available?)
- Infinite programming and theorems of the alternative
- Marginalized adaptive particle filtering for nonlinear models with unknown time-varying noise parameters
- Extending the Pennisi-McCormick second-order sufficiency theory for nonlinear programming to infinite dimensions
- Inverse radiative transfer with goal-oriented hp-adaptive mesh refinement: adaptive-mesh inversion
- Strong KKT conditions and weak sharp solutions in convex-composite optimization
- Subsmooth semi-infinite and infinite optimization problems
- Proper efficiency in vector infinite programming problems
- On generalized semi-infinite programming. (With comments and rejoinder).
- Generalized semi-infinite programming: a tutorial
- Global weak sharp minima for convex (semi-)infinite optimization problems
This page was built for publication: An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4292664)
