Sciweavers

719 search results - page 20 / 144
» Solving Sparse Linear Constraints
Sort
View
89
Voted
JMLR
2008
114views more  JMLR 2008»
14 years 10 months ago
Coordinate Descent Method for Large-scale L2-loss Linear Support Vector Machines
Linear support vector machines (SVM) are useful for classifying large-scale sparse data. Problems with sparse features are common in applications such as document classification a...
Kai-Wei Chang, Cho-Jui Hsieh, Chih-Jen Lin
ICASSP
2011
IEEE
14 years 2 months ago
The Rotational Lasso
This paper presents a sparse approach of solving the onesided Procrustes problem with special orthogonal constraint. By leveraging a planar decomposition common to all rotation ma...
Alexander Lorbert, Peter J. Ramadge
ORL
2006
105views more  ORL 2006»
14 years 10 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
CISS
2007
IEEE
15 years 4 months ago
Sensor Location through Linear Programming with Arrival Angle Constraints
Abstract— In previous work, we established a linear programming framework to determine sensor location from measured link distances between neighboring nodes in a network. Beside...
Camillo Gentile, John Shiu
CONSTRAINTS
2010
193views more  CONSTRAINTS 2010»
14 years 7 months ago
Constraint propagation on quadratic constraints
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after...
Ferenc Domes, Arnold Neumaier