Results 1  10
of
526
Adaptive Wavelet Methods For Saddle Point Problems  Optimal Convergence Rates
 IGPM report, RWTH Aachen
, 2001
"... In this paper an adaptive wavelet scheme for saddle point problems is developed and analysed. Under the assumption that the underlying continuous problem satisfies the infsup condition it is shown in the first part under which circumstances the scheme exhibits asymptotically optimal complexity. Thi ..."
Abstract

Cited by 45 (18 self)
 Add to MetaCart
In this paper an adaptive wavelet scheme for saddle point problems is developed and analysed. Under the assumption that the underlying continuous problem satisfies the infsup condition it is shown in the first part under which circumstances the scheme exhibits asymptotically optimal complexity
Preconditioning saddlepoint systems . ..
"... Saddlepoint systems arise in many applications areas, in fact in any situation where an extremum principle arises with constraints. The Stokes problem describing slow viscous flow of an incompressible fluid is a classic example coming from PDEs and in the area of optimization such problems are ubi ..."
Abstract
 Add to MetaCart
are ubiquitous. In this paper we present a framework into which many wellknown methods for solving saddlepoint systems fit. Based on this description we show how new approaches for the solution of saddlepoint systems arising in optimization can be derived from the Bramble– Pasciak conjugate gradient approach
Adapting ranking SVM to document retrieval
 In Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
, 2006
"... The paper is concerned with applying learning to rank to document retrieval. Ranking SVM is a typical method of learning to rank. We point out that there are two factors one must consider when applying Ranking SVM, in general a “learning to rank” method, to document retrieval. First, correctly ranki ..."
Abstract

Cited by 124 (21 self)
 Add to MetaCart
The paper is concerned with applying learning to rank to document retrieval. Ranking SVM is a typical method of learning to rank. We point out that there are two factors one must consider when applying Ranking SVM, in general a “learning to rank” method, to document retrieval. First, correctly
Adaptive OnLine Learning Algorithms for Blind Separation  Maximum Entropy and Minimum Mutual Information
 Neural Computation
, 1997
"... There are two major approaches for blind separation: Maximum Entropy (ME) and Minimum Mutual Information (MMI). Both can be implemented by the stochastic gradient descent method for obtaining the demixing matrix. The MI is the contrast function for blind separation while the entropy is not. To just ..."
Abstract

Cited by 133 (16 self)
 Add to MetaCart
There are two major approaches for blind separation: Maximum Entropy (ME) and Minimum Mutual Information (MMI). Both can be implemented by the stochastic gradient descent method for obtaining the demixing matrix. The MI is the contrast function for blind separation while the entropy is not
Searching for saddle points of potential energy surfaces by following a reduced gradient
 J. Computat. Chem
, 1998
"... ABSTRACT: The old coordinate driving procedure to find transition structures in chemical systems is revisited. The wellknown gradient criterion, �EŽ. x � 0, which defines the stationary points of the potential energy surface Ž PES., is reduced by one equation corresponding to one search direction. ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
. In this manner, abstract curves can be defined connecting stationary points of the PES. Starting at a given minimum, one follows a wellselected coordinate to reach the saddle of interest. Usually, but not necessarily, this coordinate will be related to the reaction progress. The method, called reduced gradient
AN ORDERING METHOD FOR THE DIRECT SOLUTION OF SADDLEPOINT MATRICES ∗
"... Abstract. An ordering method and accompanying factorization for the direct solution of saddlepoint matrices is presented. A simple constraint on ordering together with an assumption on the rank of parts of the matrix are sufficient to guarantee the existence of the LDL T factorization, stability con ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Abstract. An ordering method and accompanying factorization for the direct solution of saddlepoint matrices is presented. A simple constraint on ordering together with an assumption on the rank of parts of the matrix are sufficient to guarantee the existence of the LDL T factorization, stability
ITERATIVE METHODS FOR THE SOLUTION OF SADDLE POINT PROBLEM
"... Some new iterative methods for numerical solution of mixed finite element approximation of Stokes problem are presented. The idea is the use of proper preconditioning for the conjugate gradient algorithm. A particular case gives a variant of the ArrowHurwicz method. I. STATEMENT OF THE PROBLEM Let ..."
Abstract
 Add to MetaCart
Some new iterative methods for numerical solution of mixed finite element approximation of Stokes problem are presented. The idea is the use of proper preconditioning for the conjugate gradient algorithm. A particular case gives a variant of the ArrowHurwicz method. I. STATEMENT OF THE PROBLEM Let
Approximate factorization constraint preconditioners for saddlepoint matrices
 SIAM J. Sci. Comput
"... Abstract. We consider the application of the conjugate gradient method to the solution of large, symmetric indefinite linear systems. Special emphasis is put on the use of constraint preconditioners and a new factorization that can reduce the number of flops required by the preconditioning step. Res ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
Abstract. We consider the application of the conjugate gradient method to the solution of large, symmetric indefinite linear systems. Special emphasis is put on the use of constraint preconditioners and a new factorization that can reduce the number of flops required by the preconditioning step
Adaptive Wavelet Methods for Saddle Point Problems  Optimal Convergence Rates
 IGPM report, RWTH Aachen
, 2001
"... In this paper an adaptive wavelet scheme for saddle point problems is developed and analysed. Under the assumption that the underlying continuous problem satisfies the infsup condition it is shown in the first part under which circumstances the scheme exhibits asymptotically optimal complexity. Thi ..."
Abstract
 Add to MetaCart
In this paper an adaptive wavelet scheme for saddle point problems is developed and analysed. Under the assumption that the underlying continuous problem satisfies the infsup condition it is shown in the first part under which circumstances the scheme exhibits asymptotically optimal complexity
Inexact BarzilaiBorwein Method for Saddle Point Problems ∗
"... This paper considers the inexact BarzilaiBorwein algorithm applied to saddle point problems. To this aim, we study the convergence properties of the inexact BarzilaiBorwein algorithm for symmetric positive definite linear systems. Suppose that gk and g̃k are the exact residual and its approximati ..."
Abstract
 Add to MetaCart
approximation of the linear system at the kth iteration, respectively. We prove the Rlinear convergence of the algorithm if ‖g̃k − gk ‖ ≤ η‖g̃k ‖ for some small η> 0 and all k. To adapt the algorithm for solving saddle point problems, we also extend the Rlinear convergence result to the case when
Results 1  10
of
526