Pages that link to "Item:Q2315256"

The following pages link to Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions (Q2315256):

Displaying 11 items.

• A discussion of probability functions and constraints from a variational perspective (Q829489) (← links)
• The ABC of DC programming (Q829493) (← links)
• A derivative-free trust-region algorithm with copula-based models for probability maximization problems (Q2076911) (← links)
• DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
• Some brief observations in minimizing the sum of locally Lipschitzian functions (Q2174893) (← links)
• Sequential difference-of-convex programming (Q2198538) (← links)
• An augmented subgradient method for minimizing nonsmooth DC functions (Q2231043) (← links)
• Two-Stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse (Q4971014) (← links)
• On the Convexity of Level-sets of Probability Functions (Q5074513) (← links)
• Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming (Q5857290) (← links)
• Open issues and recent advances in DC programming and DCA (Q6200375) (← links)