Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
From MaRDI portal
Publication:2315256
DOI10.1007/s10957-019-01500-3zbMath1420.49016OpenAlexW2924141044WikidataQ128198112 ScholiaQ128198112MaRDI QIDQ2315256
Welington de Oliveira, Wim van Ackooij
Publication date: 2 August 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-019-01500-3
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)
Related Items
A discussion of probability functions and constraints from a variational perspective, The ABC of DC programming, DC semidefinite programming and cone constrained DC optimization. I: Theory, Some brief observations in minimizing the sum of locally Lipschitzian functions, Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints, Sequential difference-of-convex programming, Open issues and recent advances in DC programming and DCA, An augmented subgradient method for minimizing nonsmooth DC functions, On the Convexity of Level-sets of Probability Functions, Two-Stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse, A derivative-free trust-region algorithm with copula-based models for probability maximization problems, Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On local search in d.c. optimization problems
- Nonconvex bundle method with application to a delamination problem
- Level bundle methods for constrained convex optimization with various oracles
- Level bundle-like algorithms for convex optimization
- On functions representable as a difference of convex functions
- An introduction to copulas.
- Multivariate Archimedean copulas, \(d\)-monotone functions and \(\ell _{1}\)-norm symmetric distributions
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Computing proximal points of nonconvex functions
- A bundle-Newton method for nonsmooth unconstrained minimization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- On Fréchet subdifferentials
- Exact penalty in d. c. programming
- A review on ambiguity in stochastic portfolio optimization
- Target radius methods for nonsmooth convex optimization
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- New variants of bundle methods
- Proximal bundle methods for nonsmooth DC programming
- An inertial algorithm for DC programming
- A local search method for optimization problem with d.c. inequality constraints
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- Characterization and recognition of d.c. functions
- Techniques of variational analysis
- Copula Modeling: An Introduction for Practitioners
- Convexity and optimization with copulæ structured probabilistic constraints
- Computing B-Stationary Points of Nonsmooth DC Programs
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- The Cutting-Plane Method for Solving Convex Programs
- A Linearization Algorithm for Nonsmooth Minimization
- A Smooth Variational Principle With Applications to Subdifferentiability and to Differentiability of Convex Functions
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
- Computation of the distance to semi-algebraic sets
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Benchmarking optimization software with performance profiles.
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
