DC programming and DCA for solving Brugnano-Casulli piecewise linear systems

DOI10.1016/j.cor.2016.04.005zbMath1391.90494OpenAlexW2348824679MaRDI QIDQ1652418

Vinh Thanh Ho, Hoai An Le Thi, Tao Pham Dinh

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.04.005

zbMATH Keywords

DCApiecewise linear systemsDC programmingpiecewise linear optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (2)

DCA-based algorithms for DC fitting ⋮ DC programming and DCA: thirty years of developments

Cites Work

• Unnamed Item
• Unnamed Item
• DC approximation approaches for sparse optimization
• On solving linear complementarity problems by DC programming and DCA
• Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
• On the solution of NP-hard linear complementarity problems
• Self-organizing maps by difference of convex functions optimization
• Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Semi-implicit finite difference methods for the two-dimensional shallow water equations
• Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm
• A damped semismooth Newton method for the Brugnano-Casulli piecewise linear system
• FS\(_-\)SFS: a novel feature selection method for support vector machines
• Discrete tomography by convex--concave regularization and D.C. programming
• DC Programming Approaches for Distance Geometry Problems
• A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
• A Difference of Convex Functions Algorithm for Switched Linear Regression
• Large-Scale Portfolio Optimization
• Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
• Iterative Solution of Piecewise Linear Systems and Applications to Flows in Porous Media
• Iterative Solution of Piecewise Linear Systems
• A high-resolution wetting and drying algorithm for free-surface hydrodynamics
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Multicategory ψ-Learning
• Combined SVM-based feature selection and classification
• Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP
• Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints

This page was built for publication: DC programming and DCA for solving Brugnano-Casulli piecewise linear systems