A Proof of Convergence of the Concave-Convex Procedure Using Zangwill's Theory
From MaRDI portal
Publication:2919411
DOI10.1162/NECO_a_00283zbMath1254.90180WikidataQ45960843 ScholiaQ45960843MaRDI QIDQ2919411
Gert R. G. Lanckriet, Bharath K. Sriperumbudur
Publication date: 2 October 2012
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/neco_a_00283
90C26: Nonconvex programming, global optimization
68T05: Learning and adaptive systems in artificial intelligence
Related Items
A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints, Sparse Principal Component Analysis in Hilbert Space, A Scaled Gradient Projection Method for Bayesian Learning in Dynamical Systems, DC Algorithm for Extended Robust Support Vector Machine, Robust support vector quantile regression with truncated pinball loss (RSVQR), A globally convergent algorithm for Lasso-penalized mixture of linear regression models, DC formulations and algorithms for sparse optimization problems, Multiple-source adaptation theory and algorithms, A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations, Optimal portfolio deleveraging under market impact and margin restrictions, Robustness of learning algorithms using hinge loss with outlier indicators, Computing B-Stationary Points of Nonsmooth DC Programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence properties of the EM algorithm
- Sufficient conditions for the convergence of monotonic mathematical programming algorithms
- DC programming: overview.
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- The Concave-Convex Procedure
- Multiplicative Updates for Nonnegative Quadratic Programming
- Combined SVM-based feature selection and classification
- Numerical optimization. Theoretical and practical aspects. Transl. from the French