DC programming and DCA: thirty years of developments
From MaRDI portal
Publication:1749443
DOI10.1007/s10107-018-1235-yzbMath1387.90197OpenAlexW2784638391MaRDI QIDQ1749443
Publication date: 16 May 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-018-1235-y
Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) History of mathematics in the 20th century (01A60) History of mathematics in the 21st century (01A61) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) History of operations research and mathematical programming (90-03)
Related Items
Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming, New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming, Alternating DC algorithm for partial DC programming problems, The ABC of DC programming, MM algorithms for distance covariance based sufficient dimension reduction and sufficient variable selection, Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions, Synthesizing invariant barrier certificates via difference-of-convex programming, A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning, On two recent nonconvex penalties for regularization in machine learning, The DTC (difference of tangentially convex functions) programming: optimality conditions, An Algorithm for Maximizing a Convex Function Based on Its Minimum, DC semidefinite programming and cone constrained DC optimization. I: Theory, Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation, Robust projection twin support vector machine via DC programming, Some brief observations in minimizing the sum of locally Lipschitzian functions, A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization, Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems, Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring, A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions, New Bregman proximal type algoritms for solving DC optimization problems, Optimality conditions in DC-constrained mathematical programming problems, Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound, Heuristics for Finding Sparse Solutions of Linear Inequalities, The boosted DC algorithm for linearly constrained DC programming, Minimax D-optimal designs for multivariate regression models with multi-factors, Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm, Solution methodologies for minimizing a sum of pointwise minima of two functions, Adaptively weighted difference model of anisotropic and isotropic total variation for image denoising, Unnamed Item, Learning Markov Models Via Low-Rank Optimization, Convex Maximization via Adjustable Robust Optimization, A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective, MAP inference algorithms without approximation for collective graphical models on path graphs via discrete difference of convex algorithm, Doubly iteratively reweighted algorithm for constrained compressed sensing models, Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints, Conic optimization-based algorithms for nonnegative matrix factorization, Unnamed Item, Unified SVM algorithm based on LS-DC loss, Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm, A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems, Markov chain stochastic DCA and applications in deep learning with PDEs regularization, A bundle-type method for nonsmooth DC programs, DCACO: an algorithm for designing incoherent redundant matrices, DCA approaches for simultaneous wireless information power transfer in MISO secrecy channel, A refined inertial DC algorithm for DC programming, On solving difference of convex functions programs with linear complementarity constraints, A Nonlocal Graph-PDE and Higher-Order Geometric Integration for Image Labeling, A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program, Sequential difference-of-convex programming, Concave-Convex PDMP-based Sampling, On a solution method in indefinite quadratic programming under linear constraints, Open issues and recent advances in DC programming and DCA, Alternating direction method of multipliers for nonconvex log total variation image restoration, Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints, Difference of convex algorithms for bilevel programs with applications in hyperparameter selection, Calmness of partial perturbation to composite rank constraint systems and its applications, A matrix nonconvex relaxation approach to unconstrained binary polynomial programs, Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity, Unnamed Item, Theory and Algorithms for Shapelet-Based Multiple-Instance Learning, Online Learning Based on Online DCA and Application to Online Classification, Smoothing techniques and difference of convex functions algorithms for image reconstructions, DCA-based algorithms for DC fitting, Convergence analysis of difference-of-convex algorithm with subanalytic data, Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions, DC programming and DCA for enhancing physical layer security via relay beamforming strategies, A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model, On the pervasiveness of difference-convexity in optimization and statistics, Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning, A LogTVSCAD nonconvex regularization model for image deblurring in the presence of impulse noise, A proximal DC approach for quadratic assignment problem, A bundle method for nonsmooth DC programming with application to chance-constrained problems, New global optimality conditions for nonsmooth DC optimization problems, Solving \(k\)-center problems involving sets based on optimization techniques, A preconditioned difference of convex algorithm for truncated quadratic regularization with application to imaging, The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions, D.C. programming for sparse proximal support vector machines, Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression, New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions, Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming, Unsupervised quadratic surface support vector machine with application to credit risk assessment, Solving certain complementarity problems in power markets via convex programming, A DC programming approach for solving a centralized group key management problem, Algorithmic versatility of SPF-regularization methods, Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems, A Weighted Difference of Anisotropic and Isotropic Total Variation for Relaxed Mumford--Shah Color and Multiphase Image Segmentation, Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise, A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization, Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming, Some comments on Russell graph efficiency measures in data envelopment analysis: the multiplicative approach, Penalty and Augmented Lagrangian Methods for Constrained DC Programming, Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming, A unified Douglas-Rachford algorithm for generalized DC programming, Data clustering based on the modified relaxation Cheeger cut model
Uses Software
Cites Work
- Sparse estimation of a covariance matrix
- The Adaptive Lasso and Its Oracle Properties
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- DCA based algorithms for multiple sequence alignment (MSA)
- A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks
- DC approximation approaches for sparse optimization
- Point source super-resolution via non-convex \(L_1\) based methods
- Variational multiplicative noise removal by DC programming
- A DC programming approach for planning a multisensor multizone search for a target
- DCA for solving the scheduling of lifting vehicle in an automated port container terminal
- A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors
- An efficient DC programming approach for portfolio decision with higher moments
- On solving linear complementarity problems by DC programming and DCA
- Multi-instance multi-label learning
- Exact penalty and error bounds in DC programming
- A DC programming approach for solving the symmetric eigenvalue complementarity problem
- A DC programming approach for a class of bilevel programming problems and its application in portfolio selection
- Behavior of DCA sequences for solving the trust-region subproblem
- Optimizing a multi-stage production/inventory system by DC programming based approaches
- 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
- A DC optimization-based clustering technique for edge detection
- D.C. programming approach for multicommodity network optimization problems with step increasing cost functions
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- DC models for spherical separation
- New formulations of the multiple sequence alignment problem
- Incremental proximal methods for large scale convex optimization
- 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
- New and efficient algorithms for transfer prices and inventory holding policies in two-enterprise supply chains
- On functions representable as a difference of convex functions
- Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du max
- 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
- Efficient nonconvex sparse group feature selection via continuous and discrete optimization
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- One-step sparse estimates in nonconcave penalized likelihood models
- Signal and image approximation with level-set constraints
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA
- DC programming and DCA for globally solving the value-at-risk
- Convergence of a subgradient method for computing the bound norm of matrices
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- Proximal point methods and nonconvex optimization
- Handbook of test problems in local and global optimization
- On the solution of a two ball trust region subproblem
- Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
- Simplicially-constrained DC optimization over efficient and weakly efficient sets
- Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming
- Exact penalty in d. c. programming
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- Sparse high-dimensional fractional-norm support vector machine via DC programming
- Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model
- DC programming and DCA for solving Brugnano-Casulli piecewise linear systems
- DC programming and DCA for enhancing physical layer security via cooperative jamming
- A doubly sparse approach for group variable selection
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Linear feature transform and enhancement of classification on deep neural network
- Dictionary learning for fast classification based on soft-thresholding
- Combination between global and local methods for solving an optimization problem over the efficient set
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA
- Margin maximization in spherical separation
- Value-at-risk optimization using the difference of convex algorithm
- Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization
- Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem
- Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- A combined DCA: GA for constructing highly nonlinear balanced Boolean functions in cryptography
- Robust check loss-based variable selection of high-dimensional single-index varying-coefficient model
- Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm
- Globally convergent DC trust-region methods
- A class of semi-supervised support vector machines by DC programming
- A non-convex algorithm framework based on DC programming and DCA for matrix completion
- Support vector machine polyhedral separability in semisupervised learning
- Constructing optimal sparse portfolios using regularization methods
- Solving partitioning-hub location-routing problem using DCA
- A new efficient algorithm based on DC programming and DCA for clustering
- Binary classification via spherical separator by DC programming and DCA
- An efficient DCA based algorithm for power control in large scale wireless networks
- A DC programming approach for sensor network localization with uncertainties in anchor positions
- Calibrating nonconvex penalized regression in ultra-high dimension
- A DC programming approach for feature selection in support vector machines learning
- A continuous approach for the concave cost supply problem via DC programming and DCA
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- Discrete tomography by convex--concave regularization and D.C. programming
- The eigenvalue complementarity problem
- A continuous DC programming approach to the strategic supply chain design problem from qualified partner set
- Optimization based DC programming and DCA for hierarchical clustering
- A continuous approch for globally solving linearly constrained quadratic
- Separable convexification and DCA techniques for capacity and flow assignment problems
- A Stochastic Approximation Method
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- DC Approximation Approach for ℓ0-minimization in Compressed Sensing
- DC Programming and DCA Approach for Resource Allocation Optimization in OFDMA/TDD Wireless Networks
- DC Programming and DCA for a Novel Resource Allocation Problem in Emerging Area of Cooperative Physical Layer Security
- DC Programming Approaches for Distance Geometry Problems
- A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
- Network‐Based Penalized Regression With Application to Genomic Data
- Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
- Learning sparse classifiers with difference of convex functions algorithms
- A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
- Training robust support vector regression with smooth non-convex loss function
- Proximal Newton-Type Methods for Minimizing Composite Functions
- A DC Programming Approach to the Continuous Equilibrium Network Design Problem
- DC Programming and DCA for Transmit Beamforming and Power Allocation in Multicasting Relay Network
- Solving an Infinite-Horizon Discounted Markov Decision Process by DC Programming and DCA
- Computing B-Stationary Points of Nonsmooth DC Programs
- Convergence analysis of a proximal point algorithm for minimizing differences of functions
- A Robust Approach for Nonlinear UAV Task Assignment Problem under Uncertainty
- Quadratic Eigenvalue Problems under Conic Constraints
- On difference convexity of locally Lipschitz functions
- Simultaneous supervised clustering and feature selection over a graph
- Solving continuous min max problem for single period portfolio selection with discrete constraints by DCA
- A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing
- DC Programming and DCA for General DC Programs
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- On the asymmetric eigenvalue complementarity problem
- Prior Learning and Convex-Concave Regularization of Binary Tomography
- Adaptive Reconstruction of Discrete-Valued Objects from few Projections
- Robust investment strategies with discrete asset choice constraints using DC programming
- DC programming approach for portfolio optimization under step increasing transaction costs
- Single Straddle Carrier Routing Problem in Port Container Terminals: Mathematical Model and Solving Approaches
- DC Programming Approach for a Class of Nonconvex Programs Involving l 0 Norm
- Design of Highly Nonlinear Balanced Boolean Functions Using an Hybridation of DCA and Simulated Annealing Algorithm
- Robust Truncated Hinge Loss Support Vector Machines
- Monotone Operators and the Proximal Point Algorithm
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- The Concave-Convex Procedure
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- On ψ-Learning
- Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
- LOQO:an interior point code for quadratic programming
- Trust Region Methods
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Joint Optimization of Source Power Allocation and Distributed Relay Beamforming in Multiuser Peer-to-Peer Relay Networks
- Improving Physical Layer Secrecy Using Full-Duplex Jamming Receivers
- Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
- A New Decomposition Method for Multiuser DC-Programming and Its Applications
- Joint Beamforming Optimization and Power Control for Full-Duplex MIMO Two-Way Relay Channel
- Rank-Two Beamforming and Power Allocation in Multicasting Relay Networks
- 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
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- The symmetric eigenvalue complementarity problem
- 10.1162/153244303322753751
- DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology
- Methods for Sparse and Low-Rank Recovery under Simplex Constraints
- Online Learning Based on Online DCA and Application to Online Classification
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Simultaneous Grouping Pursuit and Feature Selection Over an Undirected Graph
- Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
- A New Approach for Optimizing Traffic Signals in Networks Considering Rerouting
- Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
- Solving Relaxation Orienteering Problem Using DCA-CUT
- Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming
- 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
- A Branch and Bound Algorithm Based on DC Programming and DCA for Strategic Capacity Planning in Supply Chain Design for a New Market Opportunity
- Signal Recovery by Proximal Forward-Backward Splitting
- Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
- Convex Analysis
- Variable Selection for Support Vector Machines in Moderately High Dimensions
- Multicategory ψ-Learning
