Results 11  20
of
555
A superlinearly convergent SQP method without boundedness . . .
 JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
, 2014
"... ..."
Quadratically And Superlinearly Convergent Algorithms For The Solution Of Inequality Constrained Minimization Problems
, 1995
"... . In this paper some Newton and quasiNewton algorithms for the solution of inequality constrained minimization problems are considered. All the algorithms described produce sequences fx k g converging qsuperlinearly to the solution. Furthermore, under mild assumptions, a qquadratic convergence ra ..."
Abstract

Cited by 35 (12 self)
 Add to MetaCart
. In this paper some Newton and quasiNewton algorithms for the solution of inequality constrained minimization problems are considered. All the algorithms described produce sequences fx k g converging qsuperlinearly to the solution. Furthermore, under mild assumptions, a qquadratic convergence
Superlinear Convergence of Krylov Subspace Methods for SelfAdjoint Problems in Hilbert Space
, 2014
"... The conjugate gradient and minimum residual methods for selfadjoint problems in Hilbert space are considered. Linear and superlinear convergence results both with respect to Q and Rrates are reviewed. New results on `step Qsuperlinear and Rsuperlinear convergence for the minimum residual metho ..."
Abstract
 Add to MetaCart
The conjugate gradient and minimum residual methods for selfadjoint problems in Hilbert space are considered. Linear and superlinear convergence results both with respect to Q and Rrates are reviewed. New results on `step Qsuperlinear and Rsuperlinear convergence for the minimum residual
On Combining Feasibility, Descent and Superlinear Convergence in Inequality Constrained Optimization
 Mathematical Programming
, 1993
"... . Extension of quasiNewton techniques from unconstrained to constrained optimization via Sequential Quadratic Programming (SQP) presents several difficulties. Among these are the possible inconsistency, away from the solution, of first order approximations to the constraints, resulting in infeasibi ..."
Abstract

Cited by 60 (2 self)
 Add to MetaCart
local twostep superlinear convergence. In this note, the essential ingredients for an S...
Superlinear Convergence of Smoothing QuasiNewton Methods for Nonsmooth Equations
 J. Comp. Appl. Math
, 1996
"... We study local convergence of smoothing quasiNewton methods for solving a system of nonsmooth (nondifferentiable) equations in ! n . The feature of smoothing quasiNewton methods is to use a smooth function to approximate the nonsmooth mapping and update the quasiNewton matrix at each step. Conv ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
. Convergence results are given under directional derivative consistence property. Without differentiability we establish a DennisMor'e type superlinear convergence theorem for smoothing quasiNewton methods and we prove linear convergence of the smoothing Broyden method. Furthermore we propose a
A Path Following Method for LCP with Superlinearly Convergent Iteration Sequence
 Department of Mathematics, The University of Iowa, Iowa City, IA
, 1995
"... A new algorithm for solving linear complementarity problems with sufficient matrices is proposed. If the problem has a solution the algorithm is superlinearly convergent from any positive starting points, even for degenerate problems. Each iteration requires only one matrix factorization and at most ..."
Abstract

Cited by 10 (9 self)
 Add to MetaCart
A new algorithm for solving linear complementarity problems with sufficient matrices is proposed. If the problem has a solution the algorithm is superlinearly convergent from any positive starting points, even for degenerate problems. Each iteration requires only one matrix factorization
Superlinear Convergence Rates For The Lanczos Method Applied To Elliptic Operators
 Numer. Math
, 1997
"... . This paper investigates the convergence of the Lanczos method for computing the smallest eigenpair of a selfadjoint elliptic differential operator via inverse iteration (without shifts). Superlinear convergence rates are established, and their sharpness is investigated for a simple model problem. ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
. This paper investigates the convergence of the Lanczos method for computing the smallest eigenpair of a selfadjoint elliptic differential operator via inverse iteration (without shifts). Superlinear convergence rates are established, and their sharpness is investigated for a simple model problem
LOCAL AND SUPERLINEAR CONVERGENCE OF STRUCTURED QUASINEWTON METHODS FOR NONLINEAR OPTIMIZATION
, 1995
"... Abstract This paper is concerned with local and qsuperlinear convergence of structured quasiNewton methods for solving u n c o n ~ t r ~ i n e d and constrained optimization problems. These methods have been developed for solving optimization problems in which the Hessian matrix has a special str ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract This paper is concerned with local and qsuperlinear convergence of structured quasiNewton methods for solving u n c o n ~ t r ~ i n e d and constrained optimization problems. These methods have been developed for solving optimization problems in which the Hessian matrix has a special
A Superlinearly Convergent O(...)Iteration Algorithm for Linear Programming
 Mathematical Programming
, 1991
"... In this note we consider a large step modification of the MizunoToddYe O( p nL) predictorcorrector interiorpoint algorithm for linear programming. We demonstrate that the modified algorithm maintains its O( p nL)iteration complexity, while exhibiting superlinear convergence for general pro ..."
Abstract
 Add to MetaCart
In this note we consider a large step modification of the MizunoToddYe O( p nL) predictorcorrector interiorpoint algorithm for linear programming. We demonstrate that the modified algorithm maintains its O( p nL)iteration complexity, while exhibiting superlinear convergence for general
A Superlinearly Convergent SSLE Algorithm for Optimization Problems with Linear Complementarity Constraints
"... Abstract. In this paper we study a special kind of optimization problems with linear complementarity constraints. First, by a generalized complementarity function and perturbed technique, the discussed problem is transformed into a family of general nonlinear optimization problems containing param ..."
Abstract
 Add to MetaCart
global convergence, but also strong and superlinear convergence. At the end of the paper, some preliminary numerical experiments are reported. Key words: algorithm, complementarity constraints, global convergence, sequential systems of linear equations, superlinear convergence
Results 11  20
of
555