Pages that link to "Item:Q2976143"

The following pages link to Computing B-Stationary Points of Nonsmooth DC Programs (Q2976143):

Displaying 50 items.

• Optimizing power generation in the presence of micro-grids (Q724120) (← links)
• The ABC of DC programming (Q829493) (← links)
• On the pervasiveness of difference-convexity in optimization and statistics (Q1739035) (← links)
• DC programming and DCA: thirty years of developments (Q1749443) (← links)
• A study of the difference-of-convex approach for solving linear programs with complementarity constraints (Q1749452) (← links)
• Robust multicategory support vector machines using difference convex algorithm (Q1749454) (← links)
• Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations (Q2022171) (← links)
• Nonconvex robust programming via value-function optimization (Q2028490) (← links)
• A bundle method for nonsmooth DC programming with application to chance-constrained problems (Q2028493) (← links)
• Alternating DC algorithm for partial DC programming problems (Q2124808) (← links)
• The DTC (difference of tangentially convex functions) programming: optimality conditions (Q2146366) (← 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)
• Some brief observations in minimizing the sum of locally Lipschitzian functions (Q2174893) (← links)
• Sequential difference-of-convex programming (Q2198538) (← links)
• On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression (Q2230800) (← links)
• An augmented subgradient method for minimizing nonsmooth DC functions (Q2231043) (← links)
• Proximal bundle methods for nonsmooth DC programming (Q2274891) (← links)
• An inertial algorithm for DC programming (Q2281267) (← links)
• Piecewise affine parameterized value-function based bilevel non-cooperative games (Q2297641) (← links)
• Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions (Q2315256) (← links)
• A general double-proximal gradient algorithm for d.c. programming (Q2330650) (← links)
• Feasible methods for nonconvex nonsmooth problems with applications in green communications (Q2364485) (← links)
• Structural properties of affine sparsity constraints (Q2425165) (← links)
• Computation of the maximum likelihood estimator in low-rank factor analysis (Q2425172) (← links)
• Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization (Q2425177) (← links)
• Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints (Q2692792) (← links)
• Linear-step solvability of some folded concave and singly-parametric sparse optimization problems (Q2693645) (← links)
• Difference of convex algorithms for bilevel programs with applications in hyperparameter selection (Q2693651) (← links)
• A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem (Q2696923) (← links)
• A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
• Lifted stationary points of sparse optimization with complementarity constraints (Q2696930) (← links)
• Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity (Q2697002) (← links)
• Several Classes of Stationary Points for Rank Regularized Minimization Problems (Q3300765) (← links)
• Composite Difference-Max Programs for Modern Statistical Estimation Problems (Q4562249) (← links)
• Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms (Q4586171) (← links)
• Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems (Q4641680) (← links)
• Two-Stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse (Q4971014) (← links)
• Dual Randomized Coordinate Descent Method for Solving a Class of Nonconvex Problems (Q5003218) (← links)
• Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems (Q5010048) (← links)
• (Q5037987) (← links)
• Addendum to the paper ‘Nonsmooth DC-constrained optimization: constraint qualification and minimizing methodologies’ (Q5058412) (← links)
• Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems (Q5093646) (← links)
• MultiComposite Nonconvex Optimization for Training Deep Neural Networks (Q5114402) (← links)
• (Q5149020) (← links)
• Iteratively Reweighted Group Lasso Based on Log-Composite Regularization (Q5161764) (← links)
• On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods (Q5210513) (← links)
• Computation of second-order directional stationary points for group sparse optimization (Q5210743) (← links)
• Estimation of Individualized Decision Rules Based on an Optimized Covariate-Dependent Equivalent of Random Outcomes (Q5234282) (← links)
• Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming (Q5242930) (← links)