Pages that link to "Item:Q4571882"
From MaRDI portal
The following pages link to Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming (Q4571882):
Displayed 24 items.
- The ABC of DC programming (Q829493) (← links)
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints (Q1630269) (← links)
- Aggregate subgradient method for nonsmooth DC optimization (Q1996741) (← links)
- A bundle method for nonsmooth DC programming with application to chance-constrained problems (Q2028493) (← links)
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data (Q2066220) (← links)
- A nonconforming virtual element method for a fourth-order hemivariational inequality in Kirchhoff plate problem (Q2113627) (← links)
- The DTC (difference of tangentially convex functions) programming: optimality conditions (Q2146366) (← links)
- DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
- Classification in the multiple instance learning framework via spherical separation (Q2152886) (← links)
- Clusterwise support vector linear regression (Q2189912) (← links)
- Sequential difference-of-convex programming (Q2198538) (← links)
- Incremental DC optimization algorithm for large-scale clusterwise linear regression (Q2226259) (← links)
- An augmented subgradient method for minimizing nonsmooth DC functions (Q2231043) (← links)
- Proximal bundle methods for nonsmooth DC programming (Q2274891) (← links)
- Virtual element method for an elliptic hemivariational inequality with applications to contact mechanics (Q2291914) (← links)
- New global optimality conditions for nonsmooth DC optimization problems (Q2301178) (← links)
- A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning (Q2633537) (← links)
- Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems (Q5010048) (← links)
- A Deep Learning Method for Elliptic Hemivariational Inequalities (Q5074898) (← links)
- A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions (Q5883328) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)
- Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints (Q6113525) (← links)
- A bundle-type method for nonsmooth DC programs (Q6154409) (← links)