Generalized block triangular preconditioner for symmetric saddle point problems
- On Approximate Representation of Periodic Motions at a Saddle Point. Martynyuk, A. A.; Nikitina, N. V. // International Applied Mechanics;Sep2002, Vol. 38 Issue 9, p1138
The results of a qualitative analysis of a bistable oscillator are applied to the approximate integration of a system with a closed trajectory about a saddle point.
- A short note on the Q-linear convergence of the steepest descent method. Ya-xiang Yuan // Mathematical Programming;Jun2010, Vol. 123 Issue 2, p339
This short note gives the sharp bound for the Q-linear convergence rate of the iterates generated by the steepest descent method with exact line searches when the objective function is strictly convex quadratic.
- Hybridization of Adaptive Differential Evolution and Two Local Search Techniques with a Restart Strategy: Some Preliminary Experimental Results. Khanum, Rashida Adeeb; Salhi, Abdellah; Jan, Muhammad Asif // Annual International Conference on Advanced Topics in Artificial;2012, p62
Classical optimization methods like Steepest Descent Method (SDM) and Broyden-Fletcher-Goldfarb-Shanno (BFGS) can solve many optimization problems. However, in case of new complex optimization problems (e.g., CEC2005 and CEC2010) with many local optima, they usually do not find the global...
- Regularized extragradient method for searching for an equilibrium point in two-person saddle-point games. Artem'eva, L. // Computational Mathematics & Mathematical Physics;Apr2012, Vol. 52 Issue 4, p495
A two-person saddle-point game with approximately given input data is examined. Since, in games of this type, the search for an equilibrium point is unstable with respect to perturbations in the input data, two variants of the regularized extragradient method are proposed. Their convergence is...
- Saddlepoint approximations as smoothers. Davison, A. C.; Suojin Wang // Biometrika;Dec2002, Vol. 89 Issue 4, p933
This note investigates the sense in which saddlepoint approximations act as smoothers of discrete distributions. The discrete problem is embedded in a continuous model that closely matches it on the discrete sample space, with saddlepoint approximation yielding an inference that is almost exact...
- SADDLE-POINT OF A FUNCTION. // Encyclopedia of Operations Research & Management Science;2001, p733
This entry provides information on the saddle-point of a function.
- SADDLE-POINT PROBLEM. // Encyclopedia of Operations Research & Management Science;2001, p733
This entry provides information on a saddle-point problem, a mathematical-programming problem.
- Reduced Basis A Posteriori Error Bounds for the Stokes Equations in Parametrized Domains: A Penalty Approach. Gerner, Anna-Lena; Veroy, Karen // AIP Conference Proceedings;9/30/2010, Vol. 1281 Issue 1, p2041
We present reduced basis approximations and associated rigorous a posteriori error bounds for the Stokes equations in parametrized domains. The method is built upon a penalty formulation for saddle point problems and provides error bounds admitting affine geometric variations with relative ease....
- Saddle points of the potential energy surface for HCCF determined by an algebraic approach. Wang, X.; Ding, S. // European Physical Journal D -- Atoms, Molecules, Clusters & Opti;Jun2004, Vol. 29 Issue 3, p337
The potential energy surface of the tetratomic molecule HCCF is determined by the U(4) algebraic method. The combination coefficients in the Hamiltonian are gotten from fitting the spectroscopic data. The molecular properties, such as, force constants and dissociation energies, are obtained in...