Pages that link to "Item:Q3192952"
From MaRDI portal
The following pages link to DC Programming and DCA for General DC Programs (Q3192952):
Displayed 43 items.
- DC approximation approaches for sparse optimization (Q319281) (← links)
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions (Q831364) (← links)
- New and efficient DCA based algorithms for minimum sum-of-squares clustering (Q898299) (← links)
- DC programming and DCA for enhancing physical layer security via cooperative jamming (Q1652424) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← 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)
- Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing (Q1749455) (← links)
- Solving certain complementarity problems in power markets via convex programming (Q2085814) (← 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)
- DC programming and DCA for enhancing physical layer security via relay beamforming strategies (Q2230771) (← links)
- Variations and extension of the convex-concave procedure (Q2358020) (← links)
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization (Q2425177) (← links)
- Difference of convex algorithms for bilevel programs with applications in hyperparameter selection (Q2693651) (← links)
- DC Programming and DCA for a Novel Resource Allocation Problem in Emerging Area of Cooperative Physical Layer Security (Q2808071) (← links)
- Computing B-Stationary Points of Nonsmooth DC Programs (Q2976143) (← links)
- DC Programming and DCA for General DC Programs (Q3192952) (← links)
- A DC Programming Approach for Sparse Linear Discriminant Analysis (Q3192955) (← links)
- The Confrontation of Two Clustering Methods in Portfolio Management: Ward’s Method Versus DCA Method (Q3192958) (← links)
- DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology (Q4983006) (← 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)
- Confidence Bands for a Log-Concave Density (Q5057281) (← links)
- Addendum to the paper ‘Nonsmooth DC-constrained optimization: constraint qualification and minimizing methodologies’ (Q5058412) (← links)
- Canonical Duality-Triality Theory: Unified Understanding for Modeling, Problems, and NP-Hardness in Global Optimization of Multi-Scale Systems (Q5114939) (← links)
- DC Programming and DCA for Enhancing Physical Layer Security in Amplify-and-Forward Relay Beamforming Networks Based on the SNR Approach (Q5214094) (← links)
- Block Clustering Based on Difference of Convex Functions (DC) Programming and DC Algorithms (Q5378276) (← links)
- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies (Q5379467) (← links)
- Learning in Repeated Auctions (Q5863991) (← links)
- Penalty and Augmented Lagrangian Methods for Constrained DC Programming (Q5868956) (← links)
- Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming (Q5869814) (← links)
- DC programming approaches for discrete portfolio optimization under concave transaction costs (Q5963231) (← links)
- Estimating individualized treatment rules with risk constraint (Q6047773) (← links)
- A new global algorithm for factor-risk-constrained mean-variance portfolio selection (Q6064034) (← links)
- Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints (Q6113525) (← links)
- DCA approaches for simultaneous wireless information power transfer in MISO secrecy channel (Q6159462) (← links)
- On solving difference of convex functions programs with linear complementarity constraints (Q6166653) (← links)
- Effective algorithms for optimal portfolio deleveraging problem with cross impact (Q6178391) (← links)
- Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization (Q6188511) (← links)
- Minimizing sequences in a constrained DC optimization problem (Q6194921) (← links)
- Open issues and recent advances in DC programming and DCA (Q6200375) (← links)