Stochastic difference-of-convex-functions algorithms for nonconvex programming
From MaRDI portal
Recommendations
- A stochastic primal-dual method for a class of nonconvex constrained optimization
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- Stochastic proximal difference-of-convex algorithm with SPIDER for a class of nonconvex nonsmooth regularized problems
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
Cites work
- A continuous approch for globally solving linearly constrained quadratic
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A Parallel Decomposition Method for Nonconvex Stochastic Multi-Agent Optimization Problems
- A Stochastic Approximation Method
- A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- Clarke Subgradients of Stratifiable Functions
- Composite difference-MAX programs for modern statistical estimation problems
- Computing B-stationary points of nonsmooth DC programs
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- Convex Analysis
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC approximation approaches for sparse optimization
- DC programming and DCA for general DC programs
- DC programming and DCA: thirty years of developments
- Decomposition methods for computing directional stationary solutions of a class of nonsmooth nonconvex optimization problems
- Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- Gradient Convergence in Gradient methods with Errors
- scientific article; zbMATH DE number 3724209 (Why is no real title available?)
- scientific article; zbMATH DE number 193918 (Why is no real title available?)
- scientific article; zbMATH DE number 1795206 (Why is no real title available?)
- scientific article; zbMATH DE number 3449561 (Why is no real title available?)
- scientific article; zbMATH DE number 823375 (Why is no real title available?)
- Incremental majorization-minimization optimization with application to large-scale machine learning
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- Lectures on stochastic programming. Modeling and theory.
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- Non-Negative Principal Component Analysis: Message Passing Algorithms and Sharp Asymptotics
- On solving linear complementarity problems by DC programming and DCA
- On the mathematical foundations of learning
- Optimization and nonsmooth analysis
- Paraconvex functions and paraconvex sets
- Probability
- Probability: A Graduate Course
- Sample average approximation method for compound stochastic optimization problems
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Stochastic Methods for Composite and Weakly Convex Optimization Problems
- Stochastic model-based minimization of weakly convex functions
- Stochastic Successive Convex Approximation for Non-Convex Constrained Stochastic Optimization
- Technical Note—A General Inner Approximation Algorithm for Nonconvex Mathematical Programs
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Theory of Classification: a Survey of Some Recent Advances
- Two-Stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse
Cited in
(10)- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- Stochastic Successive Convex Approximation for Non-Convex Constrained Stochastic Optimization
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Markov chain stochastic DCA and applications in deep learning with PDEs regularization
- On solving difference of convex functions programs with linear complementarity constraints
- Open issues and recent advances in DC programming and DCA
- Difference-of-convex algorithm with extrapolation for nonconvex, nonsmooth optimization problems
- The proximal point method for sum of DC functions in Hadamard manifolds
This page was built for publication: Stochastic difference-of-convex-functions algorithms for nonconvex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5869814)
