Pages that link to "Item:Q845546"
From MaRDI portal
The following pages link to On representations of the feasible set in convex optimization (Q845546):
Displaying 35 items.
- Barrier method in nonsmooth convex optimization without convex representation (Q497445) (← links)
- Stability and performance verification of optimization-based controllers (Q518285) (← links)
- On convex optimization without convex representation (Q644504) (← links)
- New qualification conditions for convex optimization without convex representation (Q828724) (← links)
- Optimality conditions and a barrier method in optimization with convex geometric constraint (Q1653288) (← links)
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation (Q1681319) (← links)
- Characterizing best approximation from a convex set without convex representation (Q1717625) (← links)
- On gap functions for nonsmooth multiobjective optimization problems (Q1744623) (← links)
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming (Q1928305) (← links)
- Optimality conditions in convex optimization revisited (Q1940430) (← links)
- Robust constrained best approximation with nonconvex constraints (Q2022294) (← links)
- Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization (Q2077957) (← links)
- The DTC (difference of tangentially convex functions) programming: optimality conditions (Q2146366) (← links)
- Convex optimization without convexity of constraints on non-necessarily convex sets and its applications in customer satisfaction in automotive industry (Q2167953) (← links)
- Optimality conditions for convex problems on intersections of non necessarily convex sets (Q2173517) (← links)
- A barrier method in convex vector optimization with generalized inequality constraints (Q2174915) (← links)
- Characterizing the solution set of convex optimization problems without convexity of constraints (Q2191285) (← links)
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm (Q2200088) (← links)
- Optimality and duality for vector optimization problem with non-convex feasible set (Q2307976) (← links)
- Optimality conditions in convex optimization with locally Lipschitz constraints (Q2311199) (← links)
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints (Q2338487) (← links)
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints (Q2355322) (← links)
- Necessary and sufficient KKT optimality conditions in non-convex optimization (Q2361126) (← links)
- Optimality conditions in optimization problems with convex feasible set using convexificators (Q2408896) (← links)
- Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems (Q2796798) (← links)
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators (Q4639127) (← links)
- Nonsmooth Constraint Qualifications for Nonconvex Inequality Systems (Q5039375) (← links)
- (Q5121102) (← links)
- (Q5124387) (← links)
- (Q5142530) (← links)
- Optimality Conditions for Nonconvex Constrained Optimization Problems (Q5238081) (← links)
- Rational Generalized Nash Equilibrium Problems (Q6116245) (← links)
- Hausdorff distance between convex semialgebraic sets (Q6154398) (← links)
- Karush-Kuhn-Tucker optimality conditions for non-smooth geodesic quasi-convex optimization on Riemannian manifolds (Q6611212) (← links)
- Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling (Q6631573) (← links)
