Open issues and recent advances in DC programming and DCA (Q6200375)

!

WARNING

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use the normal view instead:

Open issues and recent advances in DC programming and DCA

scientific article; zbMATH DE number 7822723

Language	Label	Description	Also known as
default for all languages	No label defined
English	Open issues and recent advances in DC programming and DCA	scientific article; zbMATH DE number 7822723

Statements

instance of

scholarly article

0 references

title

Open issues and recent advances in DC programming and DCA (English)

0 references

0 references

0 references

Journal of Global Optimization

0 references

publication date

22 March 2024

0 references

zbMATH Keywords

DC programming

0 references

DCA

0 references

open key issues

0 references

recent advances

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10898-023-01272-1

0 references

cites work

The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems

0 references

DC programming and DCA: thirty years of developments

0 references

A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem

0 references

Convex analysis approach to d. c. programming: Theory, algorithms and applications

0 references

On functions representable as a difference of convex functions

0 references

Q3780016

0 references

Q4889854

0 references

Introduction to global optimization

0 references

DC programming: overview.

0 references

Convergence analysis of difference-of-convex algorithm with subanalytic data

0 references

Computing B-stationary points of nonsmooth DC programs

0 references

Exact penalty and error bounds in DC programming

0 references

Error bounds via exact penalization with applications to concave and quadratic systems

0 references

An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints

0 references

Q3028166

0 references

Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage

0 references

Q5652137

0 references

The Concave-Convex Procedure

0 references

Q4139463

0 references

Q4470269

0 references

Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems

0 references

Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory

0 references

Parallel and Distributed Methods for Constrained Nonconvex Optimization-Part II: Applications in Communications and Machine Learning

0 references

A unified convergence analysis of block successive minimization methods for nonsmooth optimization

0 references

Signal Recovery by Proximal Forward-Backward Splitting

0 references

DC programming and DCA for general DC programs

0 references

On the Sequential Quadratically Constrained Quadratic Programming Methods

0 references

Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning

0 references

Q3320132

0 references

Nonmonotone globalization techniques for the Barzilai-Borwein gradient method

0 references

Sparse Reconstruction by Separable Approximation

0 references

Some methods of speeding up the convergence of iteration methods

0 references

An inertial algorithm for DC programming

0 references

A generalized proximal point algorithm for certain non-convex minimization problems

0 references

Accelerating the DC algorithm for smooth functions

0 references

The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions

0 references

Q4552726

0 references

A proximal difference-of-convex algorithm with extrapolation

0 references

Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization

0 references

Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming

0 references

Iteratively reweighted \(\ell _1\) algorithms with extrapolation

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions

0 references

Solving a class of linearly constrained indefinite quadratic problems by DC algorithms

0 references

An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs

0 references

Q3141900

0 references

Convex Analysis

0 references

Online learning based on online DCA and application to online classification

0 references

Q5187067

0 references

Minimizing finite sums with the stochastic average gradient

0 references

Two-Stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse

0 references

Adaptive subgradient methods for online learning and stochastic optimization

0 references

A proximal stochastic gradient method with progressive variance reduction

0 references

Stochastic difference-of-convex-functions algorithms for nonconvex programming

0 references

A continuous approch for globally solving linearly constrained quadratic

0 references

DC programming techniques for solving a class of nonlinear bilevel programs

0 references

Numerical solution for optimization over the efficient set by d.c. optimization algorithms

0 references

Simplicially-constrained DC optimization over efficient and weakly efficient sets

0 references

Combination between global and local methods for solving an optimization problem over the efficient set

0 references

DC approximation approaches for sparse optimization

0 references

A continuous approach to nonlinear integer programming

0 references

DC programming approaches for discrete portfolio optimization under concave transaction costs

0 references

A DC programming approach for feature selection in support vector machines learning

0 references

Learning sparse classifiers with difference of convex functions algorithms

0 references

Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm

0 references

Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring

0 references

Alternating DC algorithm for partial DC programming problems

0 references

A new efficient algorithm based on DC programming and DCA for clustering

0 references

New and efficient DCA based algorithms for minimum sum-of-squares clustering

0 references

Q3969900

0 references

Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms

0 references

Block clustering based on difference of convex functions (DC) programming and DC algorithms

0 references

Optimization based DC programming and DCA for hierarchical clustering

0 references

A DC Programming Approach for Finding Communities in Networks

0 references

Self-organizing maps by difference of convex functions optimization

0 references

Efficient nonnegative matrix factorization by DC programming and DCA

0 references

Visualizing data using t-SNE

0 references

Combined SVM-based feature selection and classification

0 references

DCA based algorithms for feature selection in multi-class support vector machine

0 references

Calibrating nonconvex penalized regression in ultra-high dimension

0 references

Robust check loss-based variable selection of high-dimensional single-index varying-coefficient model

0 references

Variable selection in quantile regression

0 references

Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming

0 references

DC approximation approach for \(\ell_0\)-minimization in compressed sensing

0 references

A method for finding structured sparse solutions to nonnegative least squares problems with applications

0 references

Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing

0 references

Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)

0 references

Minimization of \(\ell_{1-2}\) for compressed sensing

0 references

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

0 references

The Adaptive Lasso and Its Oracle Properties

0 references

Enhancing sparsity by reweighted \(\ell _{1}\) minimization

0 references

One-step sparse estimates in nonconcave penalized likelihood models

0 references

Sparse solutions to linear inverse problems with multiple measurement vectors

0 references

Theoretical Results on Sparse Representations of Multiple-Measurement Vectors

0 references

Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression

0 references

The Joint Graphical Lasso for Inverse Covariance Estimation Across Multiple Classes

0 references

Sparse covariance matrix estimation by DCA-based algorithms

0 references

Robust optimization

0 references

Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms

0 references

Online learning and online convex optimization

0 references

A primal-dual perspective of online learning algorithms

0 references

A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning

0 references

Multicomposite nonconvex optimization for training deep neural networks

0 references

The Fritz John necessary optimality conditions in the presence of equality and inequality constraints

0 references

Q5589748

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

10.1007/S10898-023-01272-1

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6200375