Pages that link to "Item:Q1368737"
From MaRDI portal
The following pages link to Solving a class of linearly constrained indefinite quadratic problems by DC algorithms (Q1368737):
Displaying 50 items.
- Adaptively weighted large-margin angle-based classifiers (Q1750000) (← links)
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961) (← links)
- Combination between global and local methods for solving an optimization problem over the efficient set (Q1848362) (← links)
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA (Q1928496) (← links)
- A combined DCA: GA for constructing highly nonlinear balanced Boolean functions in cryptography (Q1959232) (← links)
- Aggregate subgradient method for nonsmooth DC optimization (Q1996741) (← links)
- Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (Q2044572) (← links)
- Nonnegative estimation and variable selection under minimax concave penalty for sparse high-dimensional linear regression models (Q2066516) (← links)
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems (Q2073059) (← links)
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming (Q2124794) (← links)
- A novel heuristic algorithm to solve penalized regression-based clustering model (Q2153681) (← links)
- Clusterwise support vector linear regression (Q2189912) (← links)
- Robust check loss-based variable selection of high-dimensional single-index varying-coefficient model (Q2198824) (← links)
- Boundedness of a type of iterative sequences in two-dimensional quadratic programming (Q2260662) (← links)
- A non-convex algorithm framework based on DC programming and DCA for matrix completion (Q2340366) (← links)
- Computing the nadir point for multiobjective discrete optimization problems (Q2350075) (← links)
- Variations and extension of the convex-concave procedure (Q2358020) (← links)
- A new efficient algorithm based on DC programming and DCA for clustering (Q2385500) (← links)
- Binary classification via spherical separator by DC programming and DCA (Q2393067) (← links)
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes (Q2399479) (← links)
- Robust multicategory support matrix machines (Q2425180) (← links)
- A DC programming approach for feature selection in support vector machines learning (Q2442767) (← links)
- A continuous approach for the concave cost supply problem via DC programming and DCA (Q2473032) (← links)
- Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis. (Q2477109) (← links)
- A global optimization algorithm using linear relaxation (Q2507847) (← links)
- A sparse large margin semi-supervised learning method (Q2511744) (← links)
- A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning (Q2633537) (← links)
- Optimization based DC programming and DCA for hierarchical clustering (Q2643938) (← links)
- DC auxiliary principle methods for solving lexicographic equilibrium problems (Q2679242) (← links)
- A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
- Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming (Q2786313) (← links)
- Investigate Data Dependency for Dynamic Gene Regulatory Network Identification through High-dimensional Differential Equation Approach (Q2821005) (← links)
- Laplace Error Penalty-based Variable Selection in High Dimension (Q2949868) (← links)
- A selective strategy for shakedown analysis of engineering structures (Q2952284) (← links)
- Solving an Infinite-Horizon Discounted Markov Decision Process by DC Programming and DCA (Q2955913) (← links)
- Robust penalized logistic regression with truncated loss functions (Q3087592) (← links)
- DC Programming and DCA for General DC Programs (Q3192952) (← links)
- DC Programming Approaches for BMI and QMI Feasibility Problems (Q3192953) (← links)
- A DC Programming Approach for Sparse Linear Discriminant Analysis (Q3192955) (← links)
- Minimizing Sum of Truncated Convex Functions and Its Applications (Q3391176) (← links)
- Minimum clinically important difference in medical studies (Q3465716) (← links)
- Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming (Q4571882) (← links)
- Approximate penalization path for smoothly clipped absolute deviation (Q4912042) (← links)
- An iterative algorithm to learn from positive and unlabeled examples (Q5066784) (← links)
- Multicategory large margin classification with unequal costs (Q5082932) (← links)
- Solving nonmonotone affine variational inequalities problem by DC programming and DCA (Q5113061) (← links)
- Multivariate calibration with robust signal regression (Q5142255) (← links)
- A DC Algorithm for Solving Quadratic-linear Bilevel Optimization Problems (Q5356976) (← links)
- A DC Programming Approach for Sparse Estimation of a Covariance Matrix (Q5356977) (← links)
