scientific article; zbMATH DE number 7305745
From MaRDI portal
Publication:5148366
zbMath1474.90476MaRDI QIDQ5148366
Mingbin Feng, Xin Shen, Andreas Wächter, Jong-Shi Pang, John E. Mitchell
Publication date: 3 February 2021
Full work available at URL: http://www.yokohamapublishers.jp/online-p/PJO/vol14/pjov14n2p273.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound, Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines, Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems, Sparse approximation over the cube, Constrained composite optimization and augmented Lagrangian methods, Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix, Two relaxation methods for rank minimization problems, Conic formulation of QPCCs applied to truly sparse QPs, Unnamed Item, A study of the difference-of-convex approach for solving linear programs with complementarity constraints, Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems, Solving linear programs with complementarity constraints using branch-and-cut, On integer and MPCC representability of affine sparsity, Sequential optimality conditions for cardinality-constrained optimization problems with applications, An augmented Lagrangian method for cardinality-constrained optimization problems, An enhanced logical benders approach for linear programs with complementarity constraints, A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration