Pages that link to "Item:Q2274891"
From MaRDI portal
The following pages link to Proximal bundle methods for nonsmooth DC programming (Q2274891):
Displaying 35 items.
- A discussion of probability functions and constraints from a variational perspective (Q829489) (← links)
- The ABC of DC programming (Q829493) (← links)
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations (Q1754446) (← links)
- Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels (Q1784885) (← links)
- Approximations in proximal bundle methods and decomposition of convex programs (Q1893328) (← links)
- A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming (Q1983659) (← links)
- A bundle method for nonsmooth DC programming with application to chance-constrained problems (Q2028493) (← links)
- A derivative-free trust-region algorithm with copula-based models for probability maximization problems (Q2076911) (← links)
- An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming (Q2148144) (← 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)
- Some brief observations in minimizing the sum of locally Lipschitzian functions (Q2174893) (← links)
- Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm (Q2189634) (← links)
- Sequential difference-of-convex programming (Q2198538) (← links)
- An augmented subgradient method for minimizing nonsmooth DC functions (Q2231043) (← links)
- An inertial algorithm for DC programming (Q2281267) (← links)
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions (Q2315256) (← links)
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes (Q2399479) (← links)
- A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning (Q2633537) (← links)
- The boosted DC algorithm for linearly constrained DC programming (Q2677660) (← links)
- Computing B-Stationary Points of Nonsmooth DC Programs (Q2976143) (← links)
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization (Q4673325) (← links)
- A derivative-free 𝒱𝒰-algorithm for convex finite-max problems (Q5113714) (← links)
- Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming (Q5242930) (← links)
- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies (Q5379467) (← 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)
- New Bregman proximal type algoritms for solving DC optimization problems (Q6043133) (← 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)
- Optimal Convergence Rates for the Proximal Bundle Method (Q6155876) (← links)
- A boosted DC algorithm for non-differentiable DC components with non-monotone line search (Q6568924) (← links)
- Chance-constrained programs with convex underlying functions: a bilevel convex optimization perspective (Q6568925) (← links)
- Probability rate optimization of positive Markov jump linear systems via DC programming (Q6662093) (← links)
