Convex analysis approach to d. c. programming: Theory, algorithms and applications
From MaRDI portal
Publication:1384439
zbMath0895.90152MaRDI QIDQ1384439
Publication date: 12 July 1998
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52)
Related Items
Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity, A new nonconvex low-rank tensor approximation method with applications to hyperspectral images denoising, Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound, Quantile regression of ultra-high dimensional partially linear varying-coefficient model with missing observations, Unnamed Item, Finding robust minimizer for non-convex phase retrieval, Preconditioned Algorithm for Difference of Convex Functions with Applications to Graph Ginzburg–Landau Model, The descent algorithm for solving the symmetric eigenvalue complementarity problem, Semiparametric model averaging for ultrahigh-dimensional conditional quantile prediction, Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints, Strong substitutes: structural properties, and a new algorithm for competitive equilibrium prices, Robust low-rank tensor completion via new regularized model with approximate SVD, A Based-DC Programming Approach for Planning a Multisensor Multizone Search for a Moving Target, A DC Algorithm for Solving Quadratic-linear Bilevel Optimization Problems, A DC Programming Approach for Sparse Estimation of a Covariance Matrix, A New Approach for Optimizing Traffic Signals in Networks Considering Rerouting, Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing, Continuous Relaxation for Discrete DC Programming, The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results, A generalized non-convex method for robust tensor completion, Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm, Scientific Methodology to Model Liquidity Risk in UCITS Funds with an Asset Liability Approach: A Global Response to Financial and Prudential Requirements, Markov chain stochastic DCA and applications in deep learning with PDEs regularization, Inexact proximal DC Newton-type method for nonconvex composite functions, DCA approaches for simultaneous wireless information power transfer in MISO secrecy channel, A refined inertial DC algorithm for DC programming, Enhanced total variation minimization for stable image reconstruction, On solving difference of convex functions programs with linear complementarity constraints, A DCA-Newton method for quartic minimization over the sphere, A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program, On a solution method in indefinite quadratic programming under linear constraints, Open issues and recent advances in DC programming and DCA, An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost, Utility/privacy trade-off as regularized optimal transport, One-dimensional phase retrieval: regularization, box relaxation and uniqueness, Unnamed Item, Unnamed Item, Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies, Online Learning Based on Online DCA and Application to Online Classification, Efficient Nonnegative Matrix Factorization by DC Programming and DCA, DC Algorithm for Extended Robust Support Vector Machine, Smoothing techniques and difference of convex functions algorithms for image reconstructions, Support Vector Algorithms for Optimizing the Partial Area under the ROC Curve, Sparse Covariance Matrix Estimation by DCA-Based Algorithms, Unnamed Item, A DC Programming Approach for Finding Communities in Networks, A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques, An experimental study of a DC optimization algorithm for bimatrix games, DC programming approaches for discrete portfolio optimization under concave transaction costs, Partially linear additive quantile regression in ultra-high dimension, Stochastic DCA for Sparse Multiclass Logistic Regression, DC Programming and DCA for Enhancing Physical Layer Security in Amplify-and-Forward Relay Beamforming Networks Based on the SNR Approach, On Algorithms for Difference of Monotone Operators, On Algorithms for Difference of Monotone Operators, The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions, Composite Optimization by Nonconvex Majorization-Minimization, Unnamed Item, Minimization of $\ell_{1-2}$ for Compressed Sensing, A Weighted Difference of Anisotropic and Isotropic Total Variation for Relaxed Mumford--Shah Color and Multiphase Image Segmentation, A Characteristic Function-Based Algorithm for Geodesic Active Contours, Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise, Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming, Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach, Low-rank matrix recovery with Ky Fan 2-\(k\)-norm, Alternating DC algorithm for partial DC programming problems, An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems, The ABC of DC programming, MM algorithms for distance covariance based sufficient dimension reduction and sufficient variable selection, Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints, DCA based algorithms for multiple sequence alignment (MSA), Three \(l_1\) based nonconvex methods in constructing sparse mean reverting portfolios, A revision of the rectangular algorithm for a class of DC optimization problems, DC approximation approaches for sparse optimization, Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model, Variable selection for additive partial linear quantile regression with missing covariates, An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming, Optimality conditions for the difference of convex set-valued mappings, DC semidefinite programming and cone constrained DC optimization. I: Theory, Point source super-resolution via non-convex \(L_1\) based methods, Variational multiplicative noise removal by DC programming, Sparse signal recovery via generalized Gaussian function, A DC programming approach for planning a multisensor multizone search for a target, A continuous DC programming approach for resource allocation in OFDMA/TDD wireless networks, DC programming and DCA for solving Brugnano-Casulli piecewise linear systems, DC programming and DCA for enhancing physical layer security via cooperative jamming, A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem, Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs, On the problem of minimizing a difference of polyhedral convex functions under linear constraints, Homogeneity detection for the high-dimensional generalized linear model, A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations, Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation, The springback penalty for robust signal recovery, Optimization with a class of multivariate integral stochastic order constraints, Some brief observations in minimizing the sum of locally Lipschitzian functions, A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors, Numerical comparisons of smoothing functions for optimal correction of an infeasible system of absolute value equations, A regularization interpretation of the proximal point method for weakly convex functions, Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA, Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring, Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms, On some geometric conditions for minimality of DCH-functions via DC-duality approach, Efficient nonconvex sparse group feature selection via continuous and discrete optimization, Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization, On DC optimization algorithms for solving minmax flow problems, Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem, An efficient DC programming approach for portfolio decision with higher moments, On solving linear complementarity problems by DC programming and DCA, Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem, New formulations of the multiple sequence alignment problem, Properties of two DC algorithms in quadratic programming, The directional subdifferential of the difference of two convex functions, Exact penalty and error bounds in DC programming, A DC programming approach for solving the symmetric eigenvalue complementarity problem, Simplicially-constrained DC optimization over efficient and weakly efficient sets, DC programming algorithm for clusterwise linear \(L_1\) regression, A branch-and-bound algorithm embedded with DCA for DC programming, Behavior of DCA sequences for solving the trust-region subproblem, Optimizing a multi-stage production/inventory system by DC programming based approaches, Kernel methods in system identification, machine learning and function estimation: a survey, Linear convergence of a type of iterative sequences in nonconvex quadratic programming, Convergence analysis of difference-of-convex algorithm with subanalytic data, Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\), A framework of discrete DC programming by discrete convex analysis, On the pervasiveness of difference-convexity in optimization and statistics, A proximal difference-of-convex algorithm with extrapolation, The challenge in managing new financial risks: adopting an heuristic or theoretical approach, DCA based algorithms for feature selection in multi-class support vector machine, DC programming and DCA: thirty years of developments, DC decomposition of nonconvex polynomials with algebraic techniques, Visualizing data as objects by DC (difference of convex) optimization, DC formulations and algorithms for sparse optimization problems, Continuous relaxation for discrete DC programming, A study of the difference-of-convex approach for solving linear programs with complementarity constraints, Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming, Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing, Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering, Support points, A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique, A novel robust principal component analysis algorithm of nonconvex rank approximation, On global unconstrained minimization of the difference of polyhedral functions, Noisy Euclidean distance matrix completion with a single missing node, Robust boosting with truncated loss functions, Linear feature transform and enhancement of classification on deep neural network, A proximal DC approach for quadratic assignment problem, Planning a multi-sensors search for a moving target considering traveling costs, Multiple-source adaptation theory and algorithms, Self-organizing maps by difference of convex functions optimization, Quantile regression for functional partially linear model in ultra-high dimensions, On the subdifferentiability of the difference of two functions and local minimization, Monotonic optimization for sensor cover energy problem, New and efficient algorithms for transfer prices and inventory holding policies in two-enterprise supply chains, A preconditioned difference of convex algorithm for truncated quadratic regularization with application to imaging, 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, The proximal methods for solving absolute value equation, Low order-value optimization and applications, Towards Tikhonov regularization of non-linear ill-posed problems: a dc programming approach, Global optimization from concave minimization to concave mixed variational inequality, A DC programming approach for solving a centralized group key management problem, Combination between global and local methods for solving an optimization problem over the efficient set, Deep convolutional neural networks with spatial regularization, volume and star-shape priors for image segmentation, A unified Douglas-Rachford algorithm for generalized DC programming, Variations and extension of the convex-concave procedure, Solving partitioning-hub location-routing problem using DCA, Solving a continuous multifacility location problem by DC algorithms, Unnamed Item, A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning, Robust piecewise linear L1-regression via nonsmooth DC optimization, ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs, A new efficient algorithm based on DC programming and DCA for clustering, Application of lower bound direct method to engineering structures, Nonstationary Modeling With Sparsity for Spatial Data via the Basis Graphical Lasso, 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 Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing, DC Programming and DCA for General DC Programs, DC Programming Approaches for BMI and QMI Feasibility Problems, A DC Programming Approach for Sparse Linear Discriminant Analysis, The Confrontation of Two Clustering Methods in Portfolio Management: Ward’s Method Versus DCA Method, Necessary optimality conditions for a set-valued fractional extremal programming problem under inclusion constraints, Binary classification via spherical separator by DC programming and DCA, Robust projection twin support vector machine via DC programming, A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes, Minimizing differences of convex functions with applications to facility location and clustering, A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization, Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing, Solving the index tracking problem: a continuous optimization approach, \(l_{p}\)-norm regularization method (\( 0<p<1 \)) and DC programming for correction system of inconsistency linear inequalities, Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems, A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions, A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection, A sub-additive DC approach to the complementarity problem, The boosted DC algorithm for linearly constrained DC programming, On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions, Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm, A nonconvex model with minimax concave penalty for image restoration, Clusterwise support vector linear regression, Optimization with Multivariate Stochastic Dominance Constraints, Learning Markov Models Via Low-Rank Optimization, 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, An efficient DCA based algorithm for power control in large scale wireless networks, Solving nonmonotone affine variational inequalities problem by DC programming and DCA, Sequential difference-of-convex programming, Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation, MultiComposite Nonconvex Optimization for Training Deep Neural Networks, A new nonconvex approach for image restoration with Gamma noise, A global exact penalty for rank-constrained optimization problem and 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, Qualitative properties of the minimum sum-of-squares clustering problem, Deep CNN denoiser prior for blurred images restoration with multiplicative noise, A DC programming approach for sensor network localization with uncertainties in anchor positions, Calibrating nonconvex penalized regression in ultra-high dimension, Portfolio optimization model with and without options under additional constraints, Variational models for color image correction inspired by visual perception and neuroscience, Sufficient Optimality Conditions for a Bilevel Semivectorial D.C. Problem, Nonconvex optimization for robust tensor completion from grossly sparse observations, Existence of solutions to weak nonlinear bilevel problemsviaMinSup and d.c. problems, Incremental DC optimization algorithm for large-scale clusterwise linear regression, DCA-based algorithms for DC fitting, Minimizing a sum of clipped 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, Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms, Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems, Information projection on Banach spaces with applications to state independent KL-weighted optimal control, Clustering and multifacility location with constraints via distance function penalty methods and dc programming, Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning, A continuous approach for the concave cost supply problem via DC programming and DCA, Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm, Globally convergent DC trust-region methods, Boundedness of a type of iterative sequences in two-dimensional quadratic programming, Separable convexification and DCA techniques for capacity and flow assignment problems, Proximal bundle methods for nonsmooth DC programming, Structured sparsity promoting functions, An inertial algorithm for DC programming, Sequential Convex Programming for Computing Information-Theoretic Minimal Partitions: Nonconvex Nonsmooth Optimization, Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment, Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming, On convexification of system identification criteria, Robustness of learning algorithms using hinge loss with outlier indicators, 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, Single Straddle Carrier Routing Problem in Port Container Terminals: Mathematical Model and Solving Approaches, Solving \(k\)-center problems involving sets based on optimization techniques, Two-Stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse, A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems, The modified second APG method for DC optimization problems, A difference of convex optimization algorithm for piecewise linear regression, DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology, Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions, Solving Optimization Problems over the Weakly Efficient Set, A general double-proximal gradient algorithm for d.c. programming, A Three-Operator Splitting Algorithm for Nonconvex Sparsity Regularization, Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems, A non-convex algorithm framework based on DC programming and DCA for matrix completion, Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization, Unnamed Item, A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization
