The following pages link to (Q4383822):
Displaying 11 items.
- Algorithms for overcoming the curse of dimensionality for certain Hamilton-Jacobi equations arising in control theory and elsewhere (Q313401) (← links)
- On convex optimization without convex representation (Q644504) (← links)
- On representations of the feasible set in convex optimization (Q845546) (← links)
- An inertial algorithm for DC programming (Q2281267) (← links)
- A local search method for optimization problem with d.c. inequality constraints (Q2295325) (← links)
- Necessary and sufficient KKT optimality conditions in non-convex optimization (Q2361126) (← links)
- Global optimality conditions in nonconvex optimization (Q2412831) (← links)
- Global optimality conditions and exact penalization (Q2421449) (← links)
- Global stress regularity of convex and some nonconvex variational problems (Q2462229) (← links)
- On Convex Finite-Dimensional Variational Methods in Imaging Sciences and Hamilton--Jacobi Equations (Q3454491) (← links)
- Hidden Convexity in the l0 Pseudonorm (Q5144477) (← links)
