The following pages link to (Q3208459):
Displaying 18 items.
- Non-convex self-dual Lagrangians and variational principles for certain PDE's (Q533978) (← links)
- On global unconstrained minimization of the difference of polyhedral functions (Q540713) (← links)
- The directional subdifferential of the difference of two convex functions (Q628751) (← links)
- On the subdifferentiability of the difference of two functions and local minimization (Q1005123) (← links)
- The conjugate of the difference of convex functions (Q1061004) (← links)
- Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres (Q1362986) (← links)
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints (Q1630269) (← links)
- On some geometric conditions for minimality of DCH-functions via DC-duality approach (Q1685589) (← links)
- DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445) (← links)
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961) (← links)
- A branch-and-bound algorithm embedded with DCA for DC programming (Q1954706) (← links)
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem (Q2158622) (← links)
- Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm (Q2189634) (← links)
- An augmented subgradient method for minimizing nonsmooth DC functions (Q2231043) (← links)
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms (Q2564625) (← links)
- Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming (Q4571882) (← links)
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions (Q5221263) (← links)
- Finding robust minimizer for non-convex phase retrieval (Q6087986) (← links)
