Open issues and recent advances in DC programming and DCA

Cites Work

Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming
Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression
Group variable selection via $\ell_{p,0}$ regularization and application to optimal scoring
Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning
A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning
Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Title not available (Why is that?)
Title not available (Why is that?)
The Adaptive Lasso and Its Oracle Properties
Title not available (Why is that?)
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
One-step sparse estimates in nonconcave penalized likelihood models
The Concave-Convex Procedure
Enhancing sparsity by reweighted $\ell _{1}$ minimization
Convex analysis approach to d. c. programming: Theory, algorithms and applications
DC programming: overview.
A unified convergence analysis of block successive minimization methods for nonsmooth optimization
Title not available (Why is that?)
Title not available (Why is that?)
The Joint Graphical Lasso for Inverse Covariance Estimation Across Multiple Classes
Title not available (Why is that?)
Convex Analysis
Title not available (Why is that?)
Sparse Reconstruction by Separable Approximation
Signal Recovery by Proximal Forward-Backward Splitting
The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
Title not available (Why is that?)
A generalized proximal point algorithm for certain non-convex minimization problems
Sparse solutions to linear inverse problems with multiple measurement vectors
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
Title not available (Why is that?)
Title not available (Why is that?)
Online Learning and Online Convex Optimization
Title not available (Why is that?)
Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
Title not available (Why is that?)
The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
Title not available (Why is that?)
Introduction to global optimization
Calibrating nonconvex penalized regression in ultra-high dimension
Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
A Proximal Stochastic Gradient Method with Progressive Variance Reduction
Title not available (Why is that?)
Title not available (Why is that?)
Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
A new efficient algorithm based on DC programming and DCA for clustering
A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
Combination between global and local methods for solving an optimization problem over the efficient set
A DC programming approach for feature selection in support vector machines learning
Optimization based DC programming and DCA for hierarchical clustering
Learning sparse classifiers with difference of convex functions algorithms
DC approximation approaches for sparse optimization
DC Programming and DCA for General DC Programs
Exact penalty and error bounds in DC programming
Block Clustering Based on Difference of Convex Functions (DC) Programming and DC Algorithms
Some methods of speeding up the convergence of iteration methods
An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
Self-organizing maps by difference of convex functions optimization
Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
Computing sparse representation in a highly coherent dictionary based on difference of $L_1$ and $L_2$
Minimization of $\ell_{1-2}$ for Compressed Sensing
Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
On functions representable as a difference of convex functions
A continuous approch for globally solving linearly constrained quadratic
Simplicially-constrained DC optimization over efficient and weakly efficient sets
Numerical solution for optimization over the efficient set by d.c. optimization algorithms
A continuous approach to nonlinear integer programming
DC programming techniques for solving a class of nonlinear bilevel programs
DC programming approaches for discrete portfolio optimization under concave transaction costs
Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms
Two-Stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse
A primal-dual perspective of online learning algorithms
A method for finding structured sparse solutions to nonnegative least squares problems with applications
New and efficient DCA based algorithms for minimum sum-of-squares clustering
DCA based algorithms for feature selection in multi-class support vector machine
Minimizing finite sums with the stochastic average gradient
On the Sequential Quadratically Constrained Quadratic Programming Methods
Computing B-Stationary Points of Nonsmooth DC Programs
Error bounds via exact penalization with applications to concave and quadratic systems
DC programming and DCA: thirty years of developments
Accelerating the DC algorithm for smooth functions
An inertial algorithm for DC programming
Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
Robust check loss-based variable selection of high-dimensional single-index varying-coefficient model
Combined SVM-based feature selection and classification
Title not available (Why is that?)
A DC Programming Approach for Finding Communities in Networks
Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory
Efficient Nonnegative Matrix Factorization by DC Programming and DCA
Convergence analysis of difference-of-convex algorithm with subanalytic data
A proximal difference-of-convex algorithm with extrapolation
DC Approximation Approach for ℓ0-minimization in Compressed Sensing
Parallel and Distributed Methods for Constrained Nonconvex Optimization-Part II: Applications in Communications and Machine Learning
Online Learning Based on Online DCA and Application to Online Classification
Sparse Covariance Matrix Estimation by DCA-Based Algorithms
Iteratively reweighted $\ell _1$ algorithms with extrapolation
Alternating DC algorithm for partial DC programming problems
Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
MultiComposite Nonconvex Optimization for Training Deep Neural Networks

Cited In (2)

Preface
Componentwise Dinkelbach algorithm for nonlinear fractional optimization problems

This page was built for publication: Open issues and recent advances in DC programming and DCA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6200375)