Least change secant updates can be obtained as the limit of iterated projections based on other secant updates. We show that these iterated projections can be terminated or truncated after any positive number of iterations and the local and the superlinear rate of convergence are still maintained. The truncated iterated projections method is used to find sparse and symmetric updates that are locally and superlinearly convergent
In this paper, we investigate the role of the secant or quasi-Newton condition in the sparse Broyden...
International audienceThe idea of a finite collection of closed sets having "linearly regular interse...
In this paper we present two new classes of SQP secant methods for the equality constrained optimiza...
The purpose of this paper is to present a convergence analysis of the least change secant methods i...
Abstract. The purpose of this paper is to present a convergence analysis of least change secant meth...
We develop a framework for quantitative convergence analysis of Picard iterations of expansive set-v...
The inverse Column-Updating method is a secant algorithm for solving nonlinear systems of equations ...
In this paper, we show that the main results of the local convergence theory for least-change secant...
Least-change secant updates for nonsquare matrices have been addressed recently in [6]. Here we con...
We extend the local convergence theory of least change secant update methods given by Martinez (Math...
In this thesis we develop a unified theory for establishing the local and q-superlinear convergence ...
We present a superlinearly convergent method to solve a constrained system of nonlinear equations. T...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
International audienceThe method of alternating projections is a classical tool to solve feasibility...
Abstract. Least-change secant updates for nonsquare matrices have been addressed recently in [6]. He...
In this paper, we investigate the role of the secant or quasi-Newton condition in the sparse Broyden...
International audienceThe idea of a finite collection of closed sets having "linearly regular interse...
In this paper we present two new classes of SQP secant methods for the equality constrained optimiza...
The purpose of this paper is to present a convergence analysis of the least change secant methods i...
Abstract. The purpose of this paper is to present a convergence analysis of least change secant meth...
We develop a framework for quantitative convergence analysis of Picard iterations of expansive set-v...
The inverse Column-Updating method is a secant algorithm for solving nonlinear systems of equations ...
In this paper, we show that the main results of the local convergence theory for least-change secant...
Least-change secant updates for nonsquare matrices have been addressed recently in [6]. Here we con...
We extend the local convergence theory of least change secant update methods given by Martinez (Math...
In this thesis we develop a unified theory for establishing the local and q-superlinear convergence ...
We present a superlinearly convergent method to solve a constrained system of nonlinear equations. T...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
International audienceThe method of alternating projections is a classical tool to solve feasibility...
Abstract. Least-change secant updates for nonsquare matrices have been addressed recently in [6]. He...
In this paper, we investigate the role of the secant or quasi-Newton condition in the sparse Broyden...
International audienceThe idea of a finite collection of closed sets having "linearly regular interse...
In this paper we present two new classes of SQP secant methods for the equality constrained optimiza...