Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
From MaRDI portal
Publication:1368737
DOI10.1023/A:1008288411710zbMath0905.90131OpenAlexW1589133845MaRDI QIDQ1368737
Publication date: 2 February 1999
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008288411710
global optimizationDC optimizationDC theorydecomposition branch-and-bound methodlinearly constrained indefinite quadratic problems
Related Items
Variations and extension of the convex-concave procedure ⋮ A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation ⋮ New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming ⋮ Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints ⋮ Coderivatives of implicit multifunctions and stability of variational systems ⋮ DC programming techniques for solving a class of nonlinear bilevel programs ⋮ DCA based algorithms for multiple sequence alignment (MSA) ⋮ Three \(l_1\) based nonconvex methods in constructing sparse mean reverting portfolios ⋮ A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning ⋮ Robust relevance vector machine for classification with variational inference ⋮ Expectile regression for analyzing heteroscedasticity in high dimension ⋮ DC approximation approaches for sparse optimization ⋮ Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model ⋮ A new efficient algorithm based on DC programming and DCA for clustering ⋮ An iterative algorithm to learn from positive and unlabeled examples ⋮ A novel heuristic algorithm to solve penalized regression-based clustering model ⋮ Minimum clinically important difference in medical studies ⋮ Optimization based DC programming and DCA for hierarchical clustering ⋮ A continuous DC programming approach for resource allocation in OFDMA/TDD wireless networks ⋮ DC programming and DCA for solving Brugnano-Casulli piecewise linear systems ⋮ Penalized principal logistic regression for sparse sufficient dimension reduction ⋮ On linear programming relaxations for solving polynomial programming problems ⋮ DC Programming and DCA for General DC Programs ⋮ DC Programming Approaches for BMI and QMI Feasibility Problems ⋮ A DC Programming Approach for Sparse Linear Discriminant Analysis ⋮ Binary classification via spherical separator by DC programming and DCA ⋮ A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes ⋮ Testing copositivity with the help of difference-of-convex optimization ⋮ Multicategory large margin classification with unequal costs ⋮ DCA for solving the scheduling of lifting vehicle in an automated port container terminal ⋮ Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach ⋮ An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs ⋮ Global convergence of proximal iteratively reweighted algorithm ⋮ A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors ⋮ A doubly sparse approach for group variable selection ⋮ Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA ⋮ Laplace Error Penalty-based Variable Selection in High Dimension ⋮ Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm ⋮ A selective strategy for shakedown analysis of engineering structures ⋮ Clusterwise support vector linear regression ⋮ DC auxiliary principle methods for solving lexicographic equilibrium problems ⋮ Solving an Infinite-Horizon Discounted Markov Decision Process by DC Programming and DCA ⋮ An efficient DC programming approach for portfolio decision with higher moments ⋮ On solving linear complementarity problems by DC programming and DCA ⋮ A DC Algorithm for Solving Quadratic-linear Bilevel Optimization Problems ⋮ A DC Programming Approach for Sparse Estimation of a Covariance Matrix ⋮ New and efficient DCA based algorithms for minimum sum-of-squares clustering ⋮ Robust multicategory support matrix machines ⋮ New formulations of the multiple sequence alignment problem ⋮ Properties of two DC algorithms in quadratic programming ⋮ Solving nonmonotone affine variational inequalities problem by DC programming and DCA ⋮ Robust check loss-based variable selection of high-dimensional single-index varying-coefficient model ⋮ Shakedown analysis with multidimensional loading spaces ⋮ Exact penalty and error bounds in DC programming ⋮ Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation ⋮ Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations ⋮ A DC programming approach for feature selection in support vector machines learning ⋮ A combined DCA: GA for constructing highly nonlinear balanced Boolean functions in cryptography ⋮ Behavior of DCA sequences for solving the trust-region subproblem ⋮ Linear convergence of a type of iterative sequences in nonconvex quadratic programming ⋮ Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms ⋮ Convergence analysis of difference-of-convex algorithm with subanalytic data ⋮ Multivariate calibration with robust signal regression ⋮ A computational comparison of some branch and bound methods for indefinite quadratic programs ⋮ New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation ⋮ DC programming and DCA: thirty years of developments ⋮ DC decomposition of nonconvex polynomials with algebraic techniques ⋮ On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint ⋮ Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming ⋮ Robust multicategory support vector machines using difference convex algorithm ⋮ Adaptively weighted large-margin angle-based classifiers ⋮ A continuous approach for the concave cost supply problem via DC programming and DCA ⋮ Approximate penalization path for smoothly clipped absolute deviation ⋮ Several multi-criteria programming methods for classification ⋮ Aggregate subgradient method for nonsmooth DC optimization ⋮ Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis. ⋮ Boundedness of a type of iterative sequences in two-dimensional quadratic programming ⋮ A continuous approch for globally solving linearly constrained quadratic ⋮ A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming ⋮ The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems ⋮ Outer space branch and bound algorithm for solving linear multiplicative programming problems ⋮ Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming ⋮ DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs ⋮ A global optimization algorithm using linear relaxation ⋮ Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming ⋮ A sparse large margin semi-supervised learning method ⋮ A branch and reduce approach for solving a class of low rank d.c. programs ⋮ Self-organizing maps by difference of convex functions optimization ⋮ An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation ⋮ Robust penalized logistic regression with truncated loss functions ⋮ Investigate Data Dependency for Dynamic Gene Regulatory Network Identification through High-dimensional Differential Equation Approach ⋮ Minimizing Sum of Truncated Convex Functions and Its Applications ⋮ Nonnegative estimation and variable selection under minimax concave penalty for sparse high-dimensional linear regression models ⋮ Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems ⋮ DC programming and DCA for globally solving the value-at-risk ⋮ Double regularization methods for robust feature selection and SVM classification via DC programming ⋮ Combination between global and local methods for solving an optimization problem over the efficient set ⋮ A non-convex algorithm framework based on DC programming and DCA for matrix completion ⋮ Computing the nadir point for multiobjective discrete optimization problems ⋮ Decomposition methods for solving nonconvex quadratic programs via branch and bound ⋮ Interval estimation for minimal clinically important difference and its classification error via a bootstrap scheme ⋮ A new global algorithm for factor-risk-constrained mean-variance portfolio selection ⋮ Heterogeneous Mediation Analysis on Epigenomic PTSD and Traumatic Stress in a Predominantly African American Cohort ⋮ Convergence of the projection and contraction methods for solving bilevel variational inequality problems ⋮ An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems ⋮ Effective algorithms for optimal portfolio deleveraging problem with cross impact ⋮ Transfer Learning of Individualized Treatment Rules from Experimental to Real-World Data ⋮ Set-Valued Support Vector Machine with Bounded Error Rates ⋮ On a solution method in indefinite quadratic programming under linear constraints ⋮ Open issues and recent advances in DC programming and DCA ⋮ Block Clustering Based on Difference of Convex Functions (DC) Programming and DC Algorithms ⋮ A new algorithm for the general quadratic programming problems with box constraints ⋮ DC programming approaches for discrete portfolio optimization under concave transaction costs ⋮ On Algorithms for Difference of Monotone Operators ⋮ On Algorithms for Difference of Monotone Operators ⋮ Combination of multiple functional markers to improve diagnostic accuracy ⋮ Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming
Uses Software
