Pages that link to "Item:Q1573084"
From MaRDI portal
The following pages link to Exact penalty in d. c. programming (Q1573084):
Displaying 34 items.
- DCA based algorithms for multiple sequence alignment (MSA) (Q301241) (← links)
- DCA for solving the scheduling of lifting vehicle in an automated port container terminal (Q373199) (← links)
- A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors (Q380561) (← links)
- An efficient DC programming approach for portfolio decision with higher moments (Q409263) (← links)
- Exact penalty and error bounds in DC programming (Q427389) (← links)
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- DC programming techniques for solving a class of nonlinear bilevel programs (Q839322) (← links)
- Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA (Q1035284) (← links)
- DC programming and DCA for globally solving the value-at-risk (Q1035285) (← links)
- A proximal difference-of-convex algorithm with extrapolation (Q1744881) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- DC formulations and algorithms for sparse optimization problems (Q1749449) (← links)
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961) (← links)
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA (Q1928496) (← links)
- A branch-and-bound algorithm embedded with DCA for DC programming (Q1954706) (← links)
- An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming (Q2148144) (← links)
- Some brief observations in minimizing the sum of locally Lipschitzian functions (Q2174893) (← links)
- A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model (Q2230777) (← links)
- Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm (Q2247924) (← links)
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions (Q2315256) (← links)
- A continuous approach for the concave cost supply problem via DC programming and DCA (Q2473032) (← links)
- A continuous DC programming approach to the strategic supply chain design problem from qualified partner set (Q2643929) (← links)
- Optimization based DC programming and DCA for hierarchical clustering (Q2643938) (← links)
- Solving the index tracking problem: a continuous optimization approach (Q2673302) (← links)
- DC Programming and DCA for General DC Programs (Q3192952) (← links)
- DC Programming Approaches for BMI and QMI Feasibility Problems (Q3192953) (← links)
- Single Straddle Carrier Routing Problem in Port Container Terminals: Mathematical Model and Solving Approaches (Q3627669) (← links)
- DC Programming Approach for a Class of Nonconvex Programs Involving l 0 Norm (Q3627717) (← links)
- Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity (Q5348469) (← links)
- A DC Algorithm for Solving Quadratic-linear Bilevel Optimization Problems (Q5356976) (← links)
- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies (Q5379467) (← links)
- DC Algorithm for Extended Robust Support Vector Machine (Q5380706) (← links)
- DC programming approaches for discrete portfolio optimization under concave transaction costs (Q5963231) (← links)
- DCA for Gaussian kernel support vector machines with feature selection (Q6629042) (← links)
