Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
From MaRDI portal
Publication:1029281
DOI10.1007/s10957-008-9489-9zbMath1168.90556OpenAlexW2084936896WikidataQ60241051 ScholiaQ60241051MaRDI QIDQ1029281
A. Risi, Stefano Lucidi, Chih-Jen Lin, Marco Sciandrone, Laura Palagi
Publication date: 10 July 2009
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-008-9489-9
Related Items
Optimal \(L_2\)-norm empirical importance weights for the change of probability measure, Selective bi-coordinate variations for resource allocation type problems, A convergent decomposition method for box-constrained optimization problems, Using SVM to combine global heuristics for the standard quadratic problem, A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization, Supervised classification and mathematical optimization, Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search, Distributed algorithms for convex problems with linear coupling constraints, Derivative-free methods for bound constrained mixed-integer optimization, An almost cyclic 2-coordinate descent method for singly linearly constrained problems, Unnamed Item, Efficient max-margin multi-label classification with applications to zero-shot learning, A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints, The 2-coordinate descent method for solving double-sided simplex constrained minimization problems, Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization, An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints, Simple solution methods for separable mixed linear and quadratic knapsack problem, On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds, A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training, Nonlinear optimization and support vector machines, Nonlinear optimization and support vector machines, Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training, A unified convergence framework for nonmonotone inexact decomposition methods, Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization, Derivative-free methods for mixed-integer constrained optimization problems, On the convergence of inexact block coordinate descent methods for constrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semismooth support vector machines.
- Evolution towards the maximum clique
- Massive data classification via unconstrained support vector machines
- A convergent decomposition algorithm for support vector machines
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Multipoint methods for separable nonlinear networks
- Interior-Point Methods for Massive Support Vector Machines
- Downlink beamforming for DS-CDMA mobile radio with multimedia services
- On the convergence of a modified version of SVMlightalgorithm
- Selfish Routing in Capacitated Networks
- On the working set selection in gradient projection-based decomposition techniques for support vector machines
- SSVM: A smooth support vector machine for classification
