Pages that link to "Item:Q1384439"
From MaRDI portal
The following pages link to Convex analysis approach to d. c. programming: Theory, algorithms and applications (Q1384439):
Displaying 50 items.
- Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver (Q1679488) (← links)
- On some geometric conditions for minimality of DCH-functions via DC-duality approach (Q1685589) (← links)
- DC programming algorithm for clusterwise linear \(L_1\) regression (Q1706682) (← links)
- Convergence analysis of difference-of-convex algorithm with subanalytic data (Q1730802) (← links)
- On the pervasiveness of difference-convexity in optimization and statistics (Q1739035) (← links)
- A proximal difference-of-convex algorithm with extrapolation (Q1744881) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445) (← links)
- Visualizing data as objects by DC (difference of convex) optimization (Q1749447) (← links)
- DC formulations and algorithms for sparse optimization problems (Q1749449) (← links)
- Continuous relaxation for discrete DC programming (Q1749451) (← links)
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints (Q1749452) (← links)
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453) (← links)
- Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing (Q1749455) (← links)
- Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering (Q1749775) (← links)
- A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique (Q1756799) (← links)
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961) (← links)
- Linear feature transform and enhancement of classification on deep neural network (Q1785494) (← links)
- Quantile regression for functional partially linear model in ultra-high dimensions (Q1799822) (← links)
- Monotonic optimization for sensor cover energy problem (Q1800445) (← links)
- Combination between global and local methods for solving an optimization problem over the efficient set (Q1848362) (← links)
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA (Q1928496) (← links)
- Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization (Q1935888) (← links)
- Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem (Q1937005) (← links)
- Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem (Q1941028) (← links)
- A branch-and-bound algorithm embedded with DCA for DC programming (Q1954706) (← links)
- Support points (Q1991669) (← links)
- A novel robust principal component analysis algorithm of nonconvex rank approximation (Q2004251) (← links)
- Noisy Euclidean distance matrix completion with a single missing node (Q2010104) (← links)
- A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
- Planning a multi-sensors search for a moving target considering traveling costs (Q2030597) (← links)
- Multiple-source adaptation theory and algorithms (Q2035631) (← links)
- A preconditioned difference of convex algorithm for truncated quadratic regularization with application to imaging (Q2051043) (← links)
- D.C. programming for sparse proximal support vector machines (Q2056280) (← links)
- Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression (Q2057761) (← links)
- The proximal methods for solving absolute value equation (Q2061369) (← links)
- A DC programming approach for solving a centralized group key management problem (Q2091090) (← links)
- Deep convolutional neural networks with spatial regularization, volume and star-shape priors for image segmentation (Q2103871) (← links)
- A unified Douglas-Rachford algorithm for generalized DC programming (Q2114583) (← links)
- Low-rank matrix recovery with Ky Fan 2-\(k\)-norm (Q2124796) (← links)
- Alternating DC algorithm for partial DC programming problems (Q2124808) (← links)
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems (Q2125070) (← links)
- A revision of the rectangular algorithm for a class of DC optimization problems (Q2141721) (← links)
- An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming (Q2148144) (← links)
- DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
- Sparse signal recovery via generalized Gaussian function (Q2154451) (← links)
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem (Q2158622) (← links)
- Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs (Q2158841) (← links)
- A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations (Q2163076) (← links)
- Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation (Q2163851) (← links)
