On iterative computation of fixed points and optimization

Recommendations

Expanding the applicability of the Gauss-Newton method for convex optimization under a regularity condition
Expanding the applicability of the Gauss-Newton method for convex optimization under a majorant condition
Local convergence analysis of inexact Gauss-Newton method for singular systems of equations under majorant and center-majorant condition
Extending the applicability of the Gauss-Newton method for convex composite optimization using restricted convergence domains and average Lipschitz conditions
Convergence of Gauss-Newton method for convex composite optimization. II: Applications

Cites work

scientific article; zbMATH DE number 5533901 (Why is no real title available?)
scientific article; zbMATH DE number 3760758 (Why is no real title available?)
scientific article; zbMATH DE number 477581 (Why is no real title available?)
A Gauss-Newton method for convex composite optimization
A Kantorovich-type convergence analysis for the Gauss-Newton-method
Accessibility of solutions of operator equations by Newton-like methods
Characterizations of Error Bounds for Convex Multifunctions on Banach Spaces
Computational methods in nonlinear analysis. Efficient algorithms, fixed point theory and applications
Convergence and uniqueness properties of Gauss-Newton's method
Convergence behavior of Gauss-Newton's method and extensions of the Smale point estimate theory
Convergence criterion of Newton's method for singular systems with constant rank derivatives
Convergence domains of certain iterative methods for solving nonlinear equations
Convergence of Halley's method for operators with the bounded second Fréchet-derivative in Banach spaces
Convergence of Newton's method and uniqueness of the solution of equations in Banach space
Convergence of Newton's method for systems of equations with constant rank derivatives
Convergence of Newton’s method and inverse function theorem in Banach space
Convex Analysis
Extending the applicability of the Gauss-Newton method under average Lipschitz-type conditions
Extension of Newton's method to nonlinear functions with values in a cone
Kantorovich's majorants principle for Newton's method
LOCAL CONVERGENCE ANALYSIS FOR A CERTAIN CLASS OF INEXACT METHODS
LOCAL CONVERGENCE ANALYSIS OF INEXACT NEWTON-LIKE METHODS
LOCAL CONVERGENCE ANALYSIS OF INEXACT NEWTON-LIKE METHODS
Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization
Numerical methods for equations and its applications.
On a new semilocal convergence analysis for the Jarratt method
On convergence of the Gauss-Newton method for convex composite optimization.
On regularity for constrained extremum problems. I: Sufficient optimality conditions
On regularity for constrained extremum problems. II: Necessary optimality conditions
On the ``Terra incognita for the Newton-Kantrovich method with applications
Stability Theory for Systems of Inequalities. Part I: Linear Systems
The majorant method in the theory of newton-kantorovich approximations and the pták error estimates
Weaker conditions for the convergence of Newton's method

Cited in

(5)

Iteration functions in some nonsmooth optimization algorithms
Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization
FIXED-POINT SEARCH WITH TWO ARBITRARY EQUAL PHASE SHIFTS FOR ANY NUMBER OF ITERATIONS
IMPROVING THE COMPUTATIONAL EFFICIENCY OF FIXED POINT ALGORITHMS
scientific article; zbMATH DE number 1047592 (Why is no real title available?)

This page was built for publication: On iterative computation of fixed points and optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287945)