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