Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
From MaRDI portal
Publication:1754446
DOI10.1007/S10898-017-0568-ZzbMATH Open1418.90201OpenAlexW2754518108MaRDI QIDQ1754446FDOQ1754446
Authors: Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico, A. M. Bagirov 
Publication date: 30 May 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0568-z
Recommendations
- Proximal bundle methods for nonsmooth DC programming
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- Piecewise linear approximations in nonconvex nonsmooth optimization
- A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Cites Work
- Benchmarking optimization software with performance profiles.
- DC programming: overview.
- Title not available (Why is that?)
- Global optimality conditions for nonconvex optimization
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- DC models for spherical separation
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Convex analysis and global optimization
- A production-transportation problem with stochastic demand and concave production costs
- A partially inexact bundle method for convex semi-infinite minmax problems
- Solution of the multisource Weber and conditional Weber problems by d. -c. programming
- Global convergence of a proximal linearized algorithm for difference of convex functions
- A Method for Minimization of Quasidifferentiable Functions
- Title not available (Why is that?)
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- Introduction to nonsmooth optimization. Theory, practice and software
- Variants to the cutting plane approach for convex nondifferentiable optimization
- Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
- Gradient set splitting in nonconvex nonsmooth numerical optimization
- Codifferential method for minimizing nonsmooth DC functions
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- A bundle modification strategy for convex minimization
Cited In (42)
- A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming
- The ABC of DC programming
- Piecewise linear bounding functions in univariate global optimization
- Codifferential method for minimizing nonsmooth DC functions
- Aggregate subgradient method for nonsmooth DC optimization
- An augmented subgradient method for minimizing nonsmooth DC functions
- A bundle-type method for nonsmooth DC programs
- Solving nonmonotone affine variational inequalities problem by DC programming and DCA
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
- Essentials of numerical nonsmooth optimization
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- Difference of Convex programming in adversarial SVM
- A proximal bundle method with exact penalty technique and bundle modification strategy for nonconvex nonsmooth constrained optimization
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
- Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm
- Sequential difference-of-convex programming
- Proximal bundle methods for nonsmooth DC programming
- Incremental DC optimization algorithm for large-scale clusterwise linear regression
- An inertial algorithm for DC programming
- A bundle method for nonsmooth DC programming with application to chance-constrained problems
- 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
- DC optimization for constructing discrete Sugeno integrals and learning nonadditive measures
- Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions
- Guest editors' preface to the special issue devoted to the 2nd international conference ``Numerical computations: theory and algorithms, June 19--25, 2016, Pizzo Calabro, Italy
- A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning
- Piecewise linear approximations in nonconvex nonsmooth optimization
- Maximum-margin polyhedral separation for binary multiple instance learning
- Feature selection in SVM via polyhedral \(k\)-norm
- Finding the set of global minimizers of a piecewise affine function
- Addendum to the paper ‘Nonsmooth DC-constrained optimization: constraint qualification and minimizing methodologies’
- New global optimality conditions for nonsmooth DC optimization problems
- A maximum-margin multisphere approach for binary multiple instance learning
- 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
- Polyhedral separation via difference of convex (DC) programming
- On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials
- Essentials of numerical nonsmooth optimization
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
Uses Software
This page was built for publication: Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1754446)
