Proximal bundle methods for nonsmooth DC programming
From MaRDI portal
Publication:2274891
DOI10.1007/s10898-019-00755-4zbMath1428.90130OpenAlexW2918733380WikidataQ128308821 ScholiaQ128308821MaRDI QIDQ2274891
Publication date: 1 October 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00755-4
Related Items
A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions, A discussion of probability functions and constraints from a variational perspective, The ABC of DC programming, A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning, An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming, DC semidefinite programming and cone constrained DC optimization. I: Theory, Classification in the multiple instance learning framework via spherical separation, Some brief observations in minimizing the sum of locally Lipschitzian functions, The boosted DC algorithm for linearly constrained DC programming, Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm, Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints, A bundle-type method for nonsmooth DC programs, Optimal Convergence Rates for the Proximal Bundle Method, Sequential difference-of-convex programming, A derivative-free 𝒱𝒰-algorithm for convex finite-max problems, An augmented subgradient method for minimizing nonsmooth DC functions, A bundle method for nonsmooth DC programming with application to chance-constrained problems, An inertial algorithm for DC programming, Essentials of numerical nonsmooth optimization, Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions, A derivative-free trust-region algorithm with copula-based models for probability maximization problems, Essentials of numerical nonsmooth optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A doubly stabilized bundle method for nonsmooth convex optimization
- Global convergence of a proximal linearized algorithm for difference of convex functions
- Nonsmooth optimization via quasi-Newton methods
- Level bundle methods for constrained convex optimization with various oracles
- Exact penalty and error bounds in DC programming
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- A DC optimization-based clustering technique for edge detection
- Comparing nonsmooth nonconvex bundle methods in solving hemivariational inequalities
- A production-transportation problem with stochastic demand and concave production costs
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Target radius methods for nonsmooth convex optimization
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- Non-Euclidean restricted memory level method for large-scale convex optimization
- New variants of bundle methods
- System modeling and optimization. 25th IFIP TC 7 conference on system modeling and optimization, CSMO 2011, Berlin, Germany, September 12--16, 2011. Revised Selected Papers
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
- A strongly convergent proximal bundle method for convex minimization in Hilbert spaces
- Computing B-Stationary Points of Nonsmooth DC Programs
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach
- Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems
- The Cutting-Plane Method for Solving Convex Programs
- Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- Generalized Bundle Methods
- A Method for Minimization of Quasidifferentiable Functions
- A Critical Note on Empirical (Sample Average, Monte Carlo) Approximation of Solutions to Chance Constrained Programs
- Gradient Formulae for Nonlinear Probabilistic Constraints with Gaussian and Gaussian-Like Distributions
- Eventual convexity of chance constrained feasible sets
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- Convex Analysis
- Convex analysis and global optimization
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Benchmarking optimization software with performance profiles.
- Optimizing sensor cover energy via DC programming
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
