DC programming and DCA: thirty years of developments (Q1749443)

scientific article; zbMATH DE number 6869177

Language	Label	Description	Also known as
English	DC programming and DCA: thirty years of developments	scientific article; zbMATH DE number 6869177

Statements

instance of

scholarly article

0 references

title

DC programming and DCA: thirty years of developments (English)

0 references

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

16 May 2018

0 references

zbMATH Keywords

DC programming

0 references

DCA

0 references

theory

0 references

algorithms

0 references

applications

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

full work available at URL

https://doi.org/10.1007/s10107-018-1235-y

0 references

cites work

Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity

0 references

A Stochastic Approximation Method

0 references

A New Decomposition Method for Multiuser DC-Programming and Its Applications

0 references

New formulations of the multiple sequence alignment problem

0 references

Support vector machine polyhedral separability in semisupervised learning

0 references

DC models for spherical separation

0 references

Margin maximization in spherical separation

0 references

On the convergence of the proximal algorithm for nonsmooth functions involving analytic features

0 references

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

0 references

On difference convexity of locally Lipschitz functions

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Q3182207

0 references

Incremental proximal methods for large scale convex optimization

0 references

Sparse estimation of a covariance matrix

0 references

Q4762624

0 references

Design of Highly Nonlinear Balanced Boolean Functions Using an Hybridation of DCA and Simulated Annealing Algorithm

0 references

Enhancing sparsity by reweighted $\ell _{1}$ minimization

0 references

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

0 references

Improving Physical Layer Secrecy Using Full-Duplex Jamming Receivers

0 references

Joint Optimization of Source Power Allocation and Distributed Relay Beamforming in Multiuser Peer-to-Peer Relay Networks

0 references

DC programming and DCA for enhancing physical layer security via cooperative jamming

0 references

Q3093412

0 references

Joint Beamforming Optimization and Power Control for Full-Duplex MIMO Two-Way Relay Channel

0 references

Signal Recovery by Proximal Forward-Backward Splitting

0 references

Trust Region Methods

0 references

An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

0 references

Q4139463

0 references

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

0 references

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

0 references

Constructing optimal sparse portfolios using regularization methods

0 references

Dictionary learning for fast classification based on soft-thresholding

0 references

Handbook of test problems in local and global optimization

0 references

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

0 references

A non-convex algorithm framework based on DC programming and DCA for matrix completion

0 references

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

0 references

Sparse high-dimensional fractional-norm support vector machine via DC programming

0 references

Robust investment strategies with discrete asset choice constraints using DC programming

0 references

Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence

0 references

On functions representable as a difference of convex functions

0 references

On the solution of a two ball trust region subproblem

0 references

Q3972966

0 references

Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres

0 references

Solving an Infinite-Horizon Discounted Markov Decision Process by DC Programming and DCA

0 references

Q2934063

0 references

Value-at-risk optimization using the difference of convex algorithm

0 references

A study of the difference-of-convex approach for solving linear programs with complementarity constraints

0 references

The eigenvalue complementarity problem

0 references

On the asymmetric eigenvalue complementarity problem

0 references

Proximal point methods and nonconvex optimization

0 references

A DC optimization-based clustering technique for edge detection

0 references

Network-based penalized regression with application to genomic data

0 references

Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem

0 references

A doubly sparse approach for group variable selection

0 references

Convergence analysis of a proximal point algorithm for minimizing differences of functions

0 references

A combined DCA: GA for constructing highly nonlinear balanced Boolean functions in cryptography

0 references

Block Clustering Based on Difference of Convex Functions (DC) Programming and DC Algorithms

0 references

Calibrating nonconvex penalized regression in ultra-high dimension

0 references

DCA for solving the scheduling of lifting vehicle in an automated port container terminal

0 references

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

0 references

Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming

0 references

DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology

0 references

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

0 references

Online Learning Based on Online DCA and Application to Online Classification

0 references

DC Programming and DCA for General DC Programs

0 references

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

0 references

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

0 references

Globally convergent DC trust-region methods

0 references

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

0 references

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

0 references

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

0 references

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

0 references

On efficient large margin semisupervised learning: method and theory

0 references

Binary classification via spherical separator by DC programming and DCA

0 references

Simultaneous Grouping Pursuit and Feature Selection Over an Undirected Graph

0 references

Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm

0 references

DC programming approach for portfolio optimization under step increasing transaction costs

0 references

Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA

0 references

A DC programming approach for solving the symmetric eigenvalue complementarity problem

0 references

A DC programming approach for planning a multisensor multizone search for a target

0 references

Self-organizing maps by difference of convex functions optimization

0 references

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

0 references

A DC Programming Approach for Finding Communities in Networks

0 references

A Robust Approach for Nonlinear UAV Task Assignment Problem under Uncertainty

0 references

Q3565731

0 references

Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du max

0 references

Multicategory <i>ψ</i>-Learning

0 references

A continuous DC programming approach to the strategic supply chain design problem from qualified partner set

0 references

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

0 references

A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems

0 references

Q4514007

0 references

A continuous approch for globally solving linearly constrained quadratic

0 references

D. c. optimization approaches via Markov models for restoration of signal (1-D) and (2-D).

0 references

Q4552726

0 references

D.C. programming approach for multicommodity network optimization problems with step increasing cost functions

0 references

Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach

0 references

Q4464637

0 references

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

0 references

A continuous approach for the concave cost supply problem via DC programming and DCA

0 references

On solving linear complementarity problems by DC programming and DCA

0 references

Simplicially-constrained DC optimization over efficient and weakly efficient sets

0 references

DC Programming Approaches for Distance Geometry Problems

0 references

Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model

0 references

DCA based algorithms for multiple sequence alignment (MSA)

0 references

Exact penalty and error bounds in DC programming

0 references

Optimization based DC programming and DCA for hierarchical clustering

0 references

DC approximation approaches for sparse optimization

0 references

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

0 references

A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems

0 references

Exact penalty in d. c. programming

0 references

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

0 references

DC programming techniques for solving a class of nonlinear bilevel programs

0 references

A DC programming approach for a class of bilevel programming problems and its application in portfolio selection

0 references

Behavior of DCA sequences for solving the trust-region subproblem

0 references

Q4856871

0 references

An efficient DCA based algorithm for power control in large scale wireless networks

0 references

Solving continuous min max problem for single period portfolio selection with discrete constraints by DCA

0 references

New and efficient algorithms for transfer prices and inventory holding policies in two-enterprise supply chains

0 references

Optimizing a multi-stage production/inventory system by DC programming based approaches

0 references

A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors

0 references

DC Programming and DCA for Transmit Beamforming and Power Allocation in Multicasting Relay Network

0 references

Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization

0 references

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

0 references

Efficient Nonnegative Matrix Factorization by DC Programming and DCA

0 references

Proximal Newton-Type Methods for Minimizing Composite Functions

0 references

Q4119153

0 references

Methods for Sparse and Low-Rank Recovery under Simplex Constraints

0 references

Variational multiplicative noise removal by DC programming

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

Point source super-resolution via non-convex $L_1$ based methods

0 references

A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing

0 references

Separable convexification and DCA techniques for capacity and flow assignment problems.

0 references

Q4215372

0 references

Q5618030

0 references

Q5323642

0 references

Single Straddle Carrier Routing Problem in Port Container Terminals: Mathematical Model and Solving Approaches

0 references

Combined SVM-based feature selection and classification

0 references

A DC programming approach for sensor network localization with uncertainties in anchor positions

0 references

Multi-instance multi-label learning

0 references

DC Approximation Approach for ℓ0-minimization in Compressed Sensing

0 references

A DC Programming Approach to the Continuous Equilibrium Network Design Problem

0 references

A Branch and Bound Algorithm Based on DC Programming and DCA for Strategic Capacity Planning in Supply Chain Design for a New Market Opportunity

0 references

DC Programming and DCA Approach for Resource Allocation Optimization in OFDMA/TDD Wireless Networks

0 references

Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming

0 references

Learning sparse classifiers with difference of convex functions algorithms

0 references

Q5652137

0 references

Q2933869

0 references

Computing B-Stationary Points of Nonsmooth DC Programs

0 references

One-step sparse estimates in nonconcave penalized likelihood models

0 references

The Adaptive Lasso and Its Oracle Properties

0 references

10.1162/153244303322753751

0 references

Prior Learning and Convex-Concave Regularization of Binary Tomography

0 references

Convergence of a subgradient method for computing the bound norm of matrices

0 references

DC programming and DCA for solving Brugnano-Casulli piecewise linear systems

0 references

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

0 references

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

0 references

Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming

0 references

DC programming approaches for discrete portfolio optimization under concave transaction costs

0 references

DC programming and DCA for globally solving the value-at-risk

0 references

An efficient DC programming approach for portfolio decision with higher moments

0 references

Signal and image approximation with level-set constraints

0 references

Q3780016

0 references

Q3772809

0 references

Sparse Covariance Matrix Estimation by DCA-Based Algorithms

0 references

Q3491338

0 references

The symmetric eigenvalue complementarity problem

0 references

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

0 references

A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks

0 references

Convex Analysis

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

Rank-Two Beamforming and Power Allocation in Multicasting Relay Networks

0 references

Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA

0 references

Discrete tomography by convex--concave regularization and D.C. programming

0 references

Adaptive Reconstruction of Discrete-Valued Objects from few Projections

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

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

0 references

Quadratic Eigenvalue Problems under Conic Constraints

0 references

Simultaneous supervised clustering and feature selection over a graph

0 references

On ψ-Learning

0 references

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

0 references

Q4470269

0 references

Solving Relaxation Orienteering Problem Using DCA-CUT

0 references

Solving partitioning-hub location-routing problem using DCA

0 references

DC Programming Approach for a Class of Nonconvex Programs Involving l 0 Norm

0 references

A New Approach for Optimizing Traffic Signals in Networks Considering Rerouting

0 references

DC Programming and DCA for a Novel Resource Allocation Problem in Emerging Area of Cooperative Physical Layer Security

0 references

The Concave-Convex Procedure

0 references

Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem

0 references

Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem

0 references

LOQO:an interior point code for quadratic programming

0 references

Q3137900

0 references

Training robust support vector regression with smooth non-convex loss function

0 references

Q3174144

0 references

Q5447526

0 references

A new algorithm and theory for penalized regression-based clustering

0 references

Robust Truncated Hinge Loss Support Vector Machines

0 references

Efficient nonconvex sparse group feature selection via continuous and discrete optimization

0 references

A class of semi-supervised support vector machines by DC programming

0 references

Minimization of $\ell_{1-2}$ for Compressed Sensing

0 references

Linear feature transform and enhancement of classification on deep neural network

0 references

Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam

0 references

Variable Selection for Support Vector Machines in Moderately High Dimensions

0 references

Identifiers

zbMATH Open document ID

1387.90197

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

10.1007/S10107-018-1235-Y

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1749443