scientific article; zbMATH DE number 4032473
From MaRDI portal
Publication:3772809
Recommendations
- scientific article; zbMATH DE number 3950216
- On solving a d.c. programming problem by a sequence of linear programs
- scientific article; zbMATH DE number 2084880
- A subgradient-based convex approximations method for DC programming and its applications
- Duality in D. C. programming: The case of several D. C. constraints
Cited in
(39)- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
- The exact extreme response and the confidence extreme response analysis of structures subjected to uncertain-but-bounded excitations
- On Algorithms for Difference of Monotone Operators
- A subgradient-based convex approximations method for DC programming and its applications
- A novel robust principal component analysis algorithm of nonconvex rank approximation
- Variations and extension of the convex-concave procedure
- An inexact proximal linearized DC algorithm with provably terminating inner loop
- An augmented subgradient method for minimizing nonsmooth DC functions
- Exploring the applications of DC programming in support vector machine learning
- DC programming and DCA: thirty years of developments
- Prior Learning and Convex-Concave Regularization of Binary Tomography
- Continuous relaxation for discrete DC programming
- A general nonconvex multiduality principle
- Some new Farkas-type results for inequality systems with DC functions
- On algorithms for difference of monotone operators
- How to regularize a difference of convex functions
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- Fenchel conjugate via Busemann function on Hadamard manifolds
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- DC programming : a variant of DCA via decomposition
- Theory and algorithms for shapelet-based multiple-instance learning
- A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
- DC algorithm for extended robust support vector machine
- Towards Tikhonov regularization of non-linear ill-posed problems: a dc programming approach
- Discrete tomography by convex--concave regularization and D.C. programming
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
- Some brief observations in minimizing the sum of locally Lipschitzian functions
- Eigenvalue analysis of structures with interval parameters using the second-order Taylor series expansion and the DCA for QB
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
- scientific article; zbMATH DE number 4041643 (Why is no real title available?)
- A framework of discrete DC programming by discrete convex analysis
- Robustness of learning algorithms using hinge loss with outlier indicators
- Efficient Convex Optimization for Non-convex Non-smooth Image Restoration
- On covering method for d.c. optimization.
- A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs
- A sub-additive DC approach to the complementarity problem
- Dualization of subgradient conditions for optimality
- Multi-label residual weighted learning for individualized combination treatment rule
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3772809)
