Pages that link to "Item:Q1749443"

The following pages link to DC programming and DCA: thirty years of developments (Q1749443):

Displaying 50 items.

• The ABC of DC programming (Q829493) (← links)
• MM algorithms for distance covariance based sufficient dimension reduction and sufficient variable selection (Q829724) (← links)
• Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions (Q831364) (← links)
• Synthesizing invariant barrier certificates via difference-of-convex programming (Q832194) (← 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 DC approach for quadratic assignment problem (Q2028476) (← links)
• A bundle method for nonsmooth DC programming with application to chance-constrained problems (Q2028493) (← 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)
• Solving certain complementarity problems in power markets via convex programming (Q2085814) (← links)
• A DC programming approach for solving a centralized group key management problem (Q2091090) (← links)
• Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming (Q2105455) (← links)
• Some comments on Russell graph efficiency measures in data envelopment analysis: the multiplicative approach (Q2106765) (← links)
• A unified Douglas-Rachford algorithm for generalized DC programming (Q2114583) (← links)
• Data clustering based on the modified relaxation Cheeger cut model (Q2115038) (← links)
• New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming (Q2124794) (← links)
• Alternating DC algorithm for partial DC programming problems (Q2124808) (← links)
• On two recent nonconvex penalties for regularization in machine learning (Q2143527) (← links)
• The DTC (difference of tangentially convex functions) programming: optimality conditions (Q2146366) (← links)
• DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
• Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation (Q2163851) (← links)
• Some brief observations in minimizing the sum of locally Lipschitzian functions (Q2174893) (← links)
• Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring (Q2185626) (← links)
• Minimax D-optimal designs for multivariate regression models with multi-factors (Q2189106) (← links)
• Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm (Q2189634) (← links)
• Sequential difference-of-convex programming (Q2198538) (← links)
• DCA-based algorithms for DC fitting (Q2226279) (← links)
• Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions (Q2230768) (← links)
• DC programming and DCA for enhancing physical layer security via relay beamforming strategies (Q2230771) (← links)
• A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model (Q2230777) (← links)
• Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning (Q2244130) (← links)
• A LogTVSCAD nonconvex regularization model for image deblurring in the presence of impulse noise (Q2244367) (← links)
• New global optimality conditions for nonsmooth DC optimization problems (Q2301178) (← links)
• Solving \(k\)-center problems involving sets based on optimization techniques (Q2301186) (← links)
• Unsupervised quadratic surface support vector machine with application to credit risk assessment (Q2327637) (← links)
• A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning (Q2633537) (← links)
• A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization (Q2667049) (← links)
• The boosted DC algorithm for linearly constrained DC programming (Q2677660) (← links)
• Solution methodologies for minimizing a sum of pointwise minima of two functions (Q2679000) (← links)
• Alternating direction method of multipliers for nonconvex log total variation image restoration (Q2691992) (← links)
• Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints (Q2692792) (← links)
• Difference of convex algorithms for bilevel programs with applications in hyperparameter selection (Q2693651) (← links)
• Calmness of partial perturbation to composite rank constraint systems and its applications (Q2694518) (← links)
• A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
• Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity (Q2697002) (← links)
• New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions (Q4986403) (← links)
• (Q4999088) (← 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)