Exact penalty in d. c. programming
From MaRDI portal
Publication:1573084
zbMath1006.90062MaRDI QIDQ1573084
Le Dung Muu, Tao Pham Dinh, Hoai An Le Thi
Publication date: 28 February 2001
Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items
DC programming techniques for solving a class of nonlinear bilevel programs ⋮ DCA based algorithms for multiple sequence alignment (MSA) ⋮ An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming ⋮ A continuous DC programming approach to the strategic supply chain design problem from qualified partner set ⋮ Optimization based DC programming and DCA for hierarchical clustering ⋮ DC Programming and DCA for General DC Programs ⋮ DC Programming Approaches for BMI and QMI Feasibility Problems ⋮ DCA for solving the scheduling of lifting vehicle in an automated port container terminal ⋮ Some brief observations in minimizing the sum of locally Lipschitzian functions ⋮ An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs ⋮ A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors ⋮ Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA ⋮ Solving the index tracking problem: a continuous optimization approach ⋮ Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity ⋮ An efficient DC programming approach for portfolio decision with higher moments ⋮ A DC Algorithm for Solving Quadratic-linear Bilevel Optimization Problems ⋮ Exact penalty and error bounds in DC programming ⋮ A branch-and-bound algorithm embedded with DCA for DC programming ⋮ Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies ⋮ DC Algorithm for Extended Robust Support Vector Machine ⋮ A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model ⋮ A proximal difference-of-convex algorithm with extrapolation ⋮ DC programming and DCA: thirty years of developments ⋮ DC formulations and algorithms for sparse optimization problems ⋮ A continuous approach for the concave cost supply problem via DC programming and DCA ⋮ Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm ⋮ The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems ⋮ DC programming approaches for discrete portfolio optimization under concave transaction costs ⋮ Single Straddle Carrier Routing Problem in Port Container Terminals: Mathematical Model and Solving Approaches ⋮ DC Programming Approach for a Class of Nonconvex Programs Involving l 0 Norm ⋮ Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions ⋮ Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA ⋮ DC programming and DCA for globally solving the value-at-risk
