Results 1  10
of
1,840
A firstorder primaldual algorithm for convex problems with applications to imaging
, 2010
"... In this paper we study a firstorder primaldual algorithm for convex optimization problems with known saddlepoint structure. We prove convergence to a saddlepoint with rate O(1/N) in finite dimensions, which is optimal for the complete class of nonsmooth problems we are considering in this paper ..."
Abstract

Cited by 436 (20 self)
 Add to MetaCart
In this paper we study a firstorder primaldual algorithm for convex optimization problems with known saddlepoint structure. We prove convergence to a saddlepoint with rate O(1/N) in finite dimensions, which is optimal for the complete class of nonsmooth problems we are considering
A Singular Value Thresholding Algorithm for Matrix Completion
, 2008
"... This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task of reco ..."
Abstract

Cited by 555 (22 self)
 Add to MetaCart
of recovering a large matrix from a small subset of its entries (the famous Netflix problem). Offtheshelf algorithms such as interior point methods are not directly amenable to large problems of this kind with over a million unknown entries. This paper develops a simple firstorder and easy
Stochastic Perturbation Theory
, 1988
"... . In this paper classical matrix perturbation theory is approached from a probabilistic point of view. The perturbed quantity is approximated by a firstorder perturbation expansion, in which the perturbation is assumed to be random. This permits the computation of statistics estimating the variatio ..."
Abstract

Cited by 907 (36 self)
 Add to MetaCart
. In this paper classical matrix perturbation theory is approached from a probabilistic point of view. The perturbed quantity is approximated by a firstorder perturbation expansion, in which the perturbation is assumed to be random. This permits the computation of statistics estimating
Simulation, verification, automated composition of web services
 In WWW
, 2002
"... Web services Webaccessible programs and devices – are a key application area for the Semantic Web. With the proliferation of Web services and the evolution towards the Semantic Web comes the opportunity to automate various Web services tasks. Our objective is to enable markup and automated reason ..."
Abstract

Cited by 391 (7 self)
 Add to MetaCart
reasoning technology to describe, simulate, compose, test, and verify compositions of Web services. We take as our starting point the DAMLS DAML+OIL ontology for describing the capabilities of Web services. We define the semantics for a relevant subset of DAMLS in terms of a firstorder logical language
Practical firstorder argumentation
 In Proceedings of the 20th American National Conference on Artificial Intelligence (AAAI’05
, 2005
"... There are many frameworks for modelling argumentation in logic. They include a formal representation of individual arguments and techniques for comparing conflicting arguments. A problem with these proposals is that they do not consider arguments for and against firstorder formulae. We present a f ..."
Abstract

Cited by 26 (7 self)
 Add to MetaCart
There are many frameworks for modelling argumentation in logic. They include a formal representation of individual arguments and techniques for comparing conflicting arguments. A problem with these proposals is that they do not consider arguments for and against firstorder formulae. We present a
Constructivism and Proof Theory
, 2003
"... Introduction to the constructive point of view in the foundations of mathematics, in
particular intuitionism due to L.E.J. Brouwer, constructive recursive mathematics
due to A.A. Markov, and Bishop’s constructive mathematics. The constructive interpretation
and formalization of logic is described. F ..."
Abstract

Cited by 205 (4 self)
 Add to MetaCart
Introduction to the constructive point of view in the foundations of mathematics, in
particular intuitionism due to L.E.J. Brouwer, constructive recursive mathematics
due to A.A. Markov, and Bishop’s constructive mathematics. The constructive interpretation
and formalization of logic is described
Firstorder ThreePoint BVPs at Resonance (II)
"... This paper deals with existence of solutions to threepoint BVPs in perturbed systems of firstorder ordinary differential equations at resonance. An existence theorem is established by using the Theorem of Borsuk and some examples are given to illustrate it. A result for computing the local degree ..."
Abstract
 Add to MetaCart
This paper deals with existence of solutions to threepoint BVPs in perturbed systems of firstorder ordinary differential equations at resonance. An existence theorem is established by using the Theorem of Borsuk and some examples are given to illustrate it. A result for computing the local degree
On the complexity of finding firstorder critical points in
, 2011
"... constrained nonlinear optimization ..."
Randomized FirstOrder Methods for Saddle Point Optimization *
"... Abstract In this paper, we present novel randomized algorithms for solving saddle point problems whose dual feasible region is given by the direct product of many convex sets. Our algorithms can achieve an O(1/N ) and O(1/N 2 ) rate of convergence, respectively, for general bilinear saddle point an ..."
Abstract
 Add to MetaCart
Abstract In this paper, we present novel randomized algorithms for solving saddle point problems whose dual feasible region is given by the direct product of many convex sets. Our algorithms can achieve an O(1/N ) and O(1/N 2 ) rate of convergence, respectively, for general bilinear saddle point
Results 1  10
of
1,840