scientific article; zbMATH DE number 7248507
From MaRDI portal
Publication:5121102
zbMath1474.90343MaRDI QIDQ5121102
Nithirat Sisarat, Rabian Wangkeeree
Publication date: 17 September 2020
Full work available at URL: http://thaijmath.in.cmu.ac.th/index.php/thaijmath/article/view/3379
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
necessary and sufficient optimality conditionsbest approximationconstraint qualificationsnonconvex constraintsstrong conical hull intersection propertyrobust convex optimization
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Robustness in mathematical programming (90C17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Robust duality in parametric convex optimization
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- On representations of the feasible set in convex optimization
- Duality in robust optimization: Primal worst equals dual best
- Generalized gradients of Lipschitz functionals
- Characterizations of robust solution set of convex programs with uncertain data
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- Robust optimization-methodology and applications
- Optimality conditions in convex optimization revisited
- Characterizing robust solution sets of convex programs under data uncertainty
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- The strong conical hull intersection property for convex programming
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Theory and Applications of Robust Optimization
- Optimization and nonsmooth analysis
- Generalized Gradients and Applications
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- 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 NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS
- Convex Analysis
- Best approximation in inner product spaces
This page was built for publication:
