Proximal bundle methods for nonsmooth DC programming
From MaRDI portal
Recommendations
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming
- A bundle method for nonsmooth DC programming with application to chance-constrained problems
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
Cites work
- scientific article; zbMATH DE number 995813 (Why is no real title available?)
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3950216 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 3466447 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- A DC optimization-based clustering technique for edge detection
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- A Method for Minimization of Quasidifferentiable Functions
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- A critical note on empirical (Sample average, Monte Carlo) approximation of solutions to chance constrained programs
- A doubly stabilized bundle method for nonsmooth convex optimization
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- A production-transportation problem with stochastic demand and concave production costs
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A redistributed proximal bundle method for nonconvex optimization
- A strongly convergent proximal bundle method for convex minimization in Hilbert spaces
- Benchmarking optimization software with performance profiles.
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Comparing nonsmooth nonconvex bundle methods in solving hemivariational inequalities
- Computing B-stationary points of nonsmooth DC programs
- Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems
- Convex Analysis
- Convex analysis and global optimization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Double bundle method for finding Clarke stationary points in nonsmooth DC programming
- Eventual convexity of chance constrained feasible sets
- Exact penalty and error bounds in DC programming
- Generalized Bundle Methods
- Global convergence of a proximal linearized algorithm for difference of convex functions
- Gradient Formulae for Nonlinear Probabilistic Constraints with Gaussian and Gaussian-Like Distributions
- Level bundle methods for constrained convex optimization with various oracles
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- New variants of bundle methods
- Non-Euclidean restricted memory level method for large-scale convex optimization
- Nonsmooth optimization via quasi-Newton methods
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Optimizing sensor cover energy via DC programming
- Sequential convex approximations to joint chance constrained programs: A Monte Carlo approach
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order 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
- Target radius methods for nonsmooth convex optimization
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(40)- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
- A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming
- Essentials of numerical nonsmooth optimization
- A discussion of probability functions and constraints from a variational perspective
- The ABC of DC programming
- Approximations in proximal bundle methods and decomposition of convex programs
- A boosted DC algorithm for non-differentiable DC components with non-monotone line search
- Chance-constrained programs with convex underlying functions: a bilevel convex optimization perspective
- New Bregman proximal type algoritms for solving DC optimization problems
- Optimal Convergence Rates for the Proximal Bundle Method
- An augmented subgradient method for minimizing nonsmooth DC functions
- A bundle-type method for nonsmooth DC programs
- scientific article; zbMATH DE number 7753389 (Why is no real title available?)
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- Essentials of numerical nonsmooth optimization
- Double bundle method for finding Clarke stationary points in nonsmooth DC programming
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm
- Sequential difference-of-convex programming
- A bundle method for nonsmooth DC programming with application to chance-constrained problems
- An inertial algorithm for DC programming
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- Classification in the multiple instance learning framework via spherical separation
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming
- Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization
- Computing B-stationary points of nonsmooth DC programs
- A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- Some brief observations in minimizing the sum of locally Lipschitzian functions
- A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning
- Convergence of New Inertial Proximal Methods for DC Programming
- Probability rate optimization of positive Markov jump linear systems via DC programming
- An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels
- A derivative-free trust-region algorithm with copula-based models for probability maximization problems
- Minimizing the difference of convex and weakly convex functions via bundle method
- Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels
- The boosted DC algorithm for linearly constrained DC programming
This page was built for publication: Proximal bundle methods for nonsmooth DC programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274891)
