Pages that link to "Item:Q644504"
From MaRDI portal
The following pages link to On convex optimization without convex representation (Q644504):
Displaying 11 items.
- Barrier method in nonsmooth convex optimization without convex representation (Q497445) (← 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)
- Optimality conditions for nonconvex problems over nearly convex feasible sets (Q2048940) (← links)
- A barrier method in convex vector optimization with generalized inequality constraints (Q2174915) (← links)
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm (Q2200088) (← links)
- Necessary and sufficient KKT optimality conditions in non-convex optimization (Q2361126) (← links)
- <i>ϵ</i>-Efficient solutions in semi-infinite multiobjective optimization (Q4634336) (← links)
- Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential Subdifferentials (Q5222253) (← links)
- Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design (Q5745606) (← links)
