scientific article; zbMATH DE number 4032473
From MaRDI portal
Publication:3772809
zbMATH Open0634.49009MaRDI QIDQ3772809FDOQ3772809
Authors: Pham Dinh Tao, S. El Bernoussi 
Publication date: 1988
Title of this publication is not available (Why is that?)
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
Nonlinear programming (90C30) Methods of reduced gradient type (90C52) Duality theory (optimization) (49N15)
Cited In (34)
- The exact extreme response and the confidence extreme response analysis of structures subjected to uncertain-but-bounded excitations
- Theory and Algorithms for Shapelet-Based Multiple-Instance Learning
- On Algorithms for Difference of Monotone Operators
- On Algorithms for Difference of Monotone Operators
- DC Algorithm for Extended Robust Support Vector Machine
- Variations and extension of the convex-concave procedure
- A novel robust principal component analysis algorithm of nonconvex rank approximation
- Prior Learning and Convex-Concave Regularization of Binary Tomography
- DC programming and DCA: thirty years of developments
- Continuous relaxation for discrete DC programming
- A general nonconvex multiduality principle
- Some new Farkas-type results for inequality systems with DC functions
- How to regularize a difference of convex functions
- Fenchel conjugate via Busemann function on Hadamard manifolds
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
- 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
- Title not available (Why is that?)
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
- A framework of discrete DC programming by discrete convex analysis
- Efficient Convex Optimization for Non-convex Non-smooth Image Restoration
- Robustness of learning algorithms using hinge loss with outlier indicators
- 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
- Multi-label residual weighted learning for individualized combination treatment rule
- Dualization of subgradient conditions for optimality
- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
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)
