Sciweavers

4 search results - page 1 / 1
» An inexact proximal point method for solving generalized fra...
Sort
View
JGO
2008
76views more  JGO 2008»
14 years 9 months ago
An inexact proximal point method for solving generalized fractional programs
Jean-Jacques Strodiot, Jean-Pierre Crouzeix, Jacqu...
91
Voted
SIAMJO
2008
79views more  SIAMJO 2008»
14 years 9 months ago
A Class of Inexact Variable Metric Proximal Point Algorithms
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and ...
Lisandro A. Parente, Pablo A. Lotito, Mikhail V. S...
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
15 years 10 months ago
A combinatorial, primal-dual approach to semidefinite programs
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
Sanjeev Arora, Satyen Kale
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
15 years 10 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales