scientific article; zbMATH DE number 1215260
From MaRDI portal
Publication:4215372
zbMath0906.68127MaRDI QIDQ4215372
Publication date: 26 October 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
New results on the equivalence between zero-one programming and continuous concave programming, DC approximation approaches for sparse optimization, An Algorithm for Maximizing a Convex Function Based on Its Minimum, Integrating support vector machines and neural networks, Solving absolute value equation using complementarity and smoothing functions, Distributed algorithms for convex problems with linear coupling constraints, On the rotational invariant \(L_1\)-norm PCA, Faster maximum feasible subsystem solutions for dense constraint matrices, Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm, Data filtering for cluster analysis by \(\ell _0\)-norm regularization, Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound, Convex Maximization via Adjustable Robust Optimization, A Smoothing Method for Sparse Optimization over Polyhedral Sets, Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets, Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\), Feasibility Pump-like heuristics for mixed integer problems, A two-phase relaxation-based heuristic for the maximum feasible subsystem problem, Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications, Frank-Wolfe and friends: a journey into projection-free first-order optimization methods, DC programming and DCA: thirty years of developments, Discrete support vector decision trees via tabu search, Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method, Tabu search approaches for solving the two-group classification problem, Concave programming for minimizing the zero-norm over polyhedral sets, Weak Stability of ℓ1-Minimization Methods in Sparse Data Reconstruction, Knapsack feasibility as an absolute value equation solvable by successive linear programming, A New Computational Method for the Sparsest Solutions to Systems of Linear Equations
Uses Software
