Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions (Q2315256): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q128198112, #quickstatements; #temporary_batch_1723632976074
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GRANSO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PNEW / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10957-019-01500-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2924141044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On functions representable as a difference of convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review on ambiguity in stochastic portfolio optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and recognition of d.c. functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inertial algorithm for DC programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact penalty in d. c. programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing B-Stationary Points of Nonsmooth DC Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On local search in d.c. optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local search method for optimization problem with d.c. inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal bundle methods for nonsmooth DC programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing proximal points of nonconvex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Redistributed Proximal Bundle Method for Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal bundle method for nonsmooth nonconvex functions with inexact information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconvex bundle method with application to a delamination problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally convergent limited memory bundle method for large-scale nonsmooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linearization Algorithm for Nonsmooth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bundle-Newton method for nonsmooth unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New variants of bundle methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Level bundle methods for constrained convex optimization with various oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5852051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Smooth Variational Principle With Applications to Subdifferentiability and to Differentiability of Convex Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques of variational analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Fréchet subdifferentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Target radius methods for nonsmooth convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Level bundle-like algorithms for convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the distance to semi-algebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copula Modeling: An Introduction for Practitioners / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to copulas. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate Archimedean copulas, \(d\)-monotone functions and \(\ell _{1}\)-norm symmetric distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and optimization with copulæ structured probabilistic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128198112 / rank
 
Normal rank

Latest revision as of 13:09, 14 August 2024

scientific article
Language Label Description Also known as
English
Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
scientific article

    Statements

    Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions (English)
    0 references
    0 references
    0 references
    2 August 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    nonconvex programming
    0 references
    nonsmooth optimization
    0 references
    lower-\(C^2\) functions
    0 references
    DC decomposition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references