On representations of the feasible set in convex optimization
From MaRDI portal
Publication:845546
DOI10.1007/s11590-009-0153-6zbMath1180.90237arXiv0911.1182OpenAlexW2093324910MaRDI QIDQ845546
Publication date: 29 January 2010
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.1182
Related Items
Necessary and sufficient KKT optimality conditions in non-convex optimization ⋮ Nonsmooth Constraint Qualifications for Nonconvex Inequality Systems ⋮ New qualification conditions for convex optimization without convex representation ⋮ The DTC (difference of tangentially convex functions) programming: optimality conditions ⋮ Optimality conditions and a barrier method in optimization with convex geometric constraint ⋮ Convex optimization without convexity of constraints on non-necessarily convex sets and its applications in customer satisfaction in automotive industry ⋮ Optimality conditions for convex problems on intersections of non necessarily convex sets ⋮ A barrier method in convex vector optimization with generalized inequality constraints ⋮ Optimality conditions in optimization problems with convex feasible set using convexificators ⋮ On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming ⋮ Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation ⋮ Convergences for robust bilevel polynomial programmes with applications ⋮ Characterizing the solution set of convex optimization problems without convexity of constraints ⋮ Rational Generalized Nash Equilibrium Problems ⋮ Optimality conditions in convex optimization revisited ⋮ Hausdorff distance between convex semialgebraic sets ⋮ On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm ⋮ On convex optimization without convex representation ⋮ Unnamed Item ⋮ Characterizing best approximation from a convex set without convex representation ⋮ Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators ⋮ Barrier method in nonsmooth convex optimization without convex representation ⋮ On gap functions for nonsmooth multiobjective optimization problems ⋮ Stability and performance verification of optimization-based controllers ⋮ Robust constrained best approximation with nonconvex constraints ⋮ Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Optimality and duality for vector optimization problem with non-convex feasible set ⋮ Optimality conditions in convex optimization with locally Lipschitz constraints ⋮ Optimality Conditions for Nonconvex Constrained Optimization Problems ⋮ Unnamed Item ⋮ Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization ⋮ Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints ⋮ Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
Cites Work
This page was built for publication: On representations of the feasible set in convex optimization
