Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
From MaRDI portal
Publication:432370
DOI10.1016/j.jmaa.2012.03.037zbMath1308.41028OpenAlexW2072515496WikidataQ59241528 ScholiaQ59241528MaRDI QIDQ432370
Vaithilingam Jeyakumar, Guoyin Li, Jin-Hua Wang
Publication date: 4 July 2012
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2012.03.037
best approximationrobust optimizationshape-preserving interpolationellipsoidal uncertaintystrong conical hull intersection property
Related Items (15)
Optimality theorems for linear fractional optimization problems involving integral functions defined on Cn [0,1] ⋮ Robustness in nonsmooth nonconvex optimization problems ⋮ Some characterizations of robust optimal solutions for uncertain convex optimization problems ⋮ Robust optimality in constrained optimization problems with application in mechanics ⋮ Necessary and sufficient optimality conditions for some robust variational problems ⋮ Robust saddle‐point criterion in second‐order partial differential equation and partial differential inequation constrained control problems ⋮ Weighted robust optimality of convex optimization problems with data uncertainty ⋮ Robust duality in parametric convex optimization ⋮ Robust penalty function method for an uncertain multi-time control optimization problems ⋮ Characterizing robust solution sets of convex programs under data uncertainty ⋮ Robust constrained best approximation with nonconvex constraints ⋮ On robust duality for fractional programming with uncertainty data ⋮ Unnamed Item ⋮ Strong duality for robust minimax fractional programming problems ⋮ Robust nonlinear optimization with conic representable uncertainty set
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- A dual approach to constrained interpolation from a convex subset of Hilbert space
- Fenchel duality and the strong conical hull intersection property
- A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
- The strong conical hull intersection property for convex programming
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Theory and Applications of Robust Optimization
- On Extension of Fenchel Duality and its Application
- Lectures on Stochastic Programming
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
- A simple closure condition for the normal cone intersection formula
- Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
- Best Approximation from the Intersection of a Closed Convex Set and a Polyhedron in Hilbert Space, Weak Slater Conditions, and the Strong Conical Hull Intersection Property
- On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
- A Global Approach to Nonlinearly Constrained Best Approximation
This page was built for publication: Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
