An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
From MaRDI portal
Publication:4292664
DOI10.1137/1036001zbMath0805.49014OpenAlexW1981306050MaRDI QIDQ4292664
Michael W. Trosset, Richard A. Tapia
Publication date: 5 February 1995
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1036001
Related Items (16)
Proper efficiency in vector infinite programming problems ⋮ Convex Parametric Programming in Abstract Spaces ⋮ Duality and liquidity constraints under uncertainty ⋮ Constraint qualifications in convex vector semi-infinite optimization ⋮ Effective method for constrained minimum - reverse bridge theorem ⋮ On generalized semi-infinite programming. (With comments and rejoinder). ⋮ On Proper Efficiency in Multiobjective Semi-infinite Optimization ⋮ Inverse radiative transfer with goal-oriented hp-adaptive mesh refinement: adaptive-mesh inversion ⋮ Strong KKT conditions and weak sharp solutions in convex-composite optimization ⋮ Generalized semi-infinite programming: a tutorial ⋮ Optimality conditions for nonlinear infinite programming problems ⋮ Global weak sharp minima for convex (semi-)infinite optimization problems ⋮ Marginalized adaptive particle filtering for nonlinear models with unknown time-varying noise parameters ⋮ Subsmooth semi-infinite and infinite optimization problems ⋮ Unnamed Item ⋮ On feasible sets defined through Chebyshev approximation
This page was built for publication: An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
