On iterative computation of fixed points and optimization
DOI10.1186/S13663-015-0372-8zbMATH Open1505.65209OpenAlexW1571897438WikidataQ59403113 ScholiaQ59403113MaRDI QIDQ287945FDOQ287945
Ioannis Konstantinos Argyros, Saïd Hilout, Yeol Je Cho
Publication date: 23 May 2016
Published in: Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13663-015-0372-8
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
fixed pointsemi-local convergenceconvex composite optimizationGauss-Newton methodmajorizing sequences
Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15)
Cites Work
- Convex Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convergence of Newton’s method and inverse function theorem in Banach space
- Computational methods in nonlinear analysis. Efficient algorithms, fixed point theory and applications
- The majorant method in the theory of newton-kantorovich approximations and the pták error estimates
- Convergence domains of certain iterative methods for solving nonlinear equations
- Weaker conditions for the convergence of Newton's method
- On regularity for constrained extremum problems. I: Sufficient optimality conditions
- On regularity for constrained extremum problems. II: Necessary optimality conditions
- A Kantorovich-type convergence analysis for the Gauss-Newton-method
- Numerical methods for equations and its applications.
- Convergence of Newton's method and uniqueness of the solution of equations in Banach space
- Extending the applicability of the Gauss-Newton method under average Lipschitz-type conditions
- Convergence behavior of Gauss-Newton's method and extensions of the Smale point estimate theory
- Convergence and uniqueness properties of Gauss-Newton's method
- A Gauss-Newton method for convex composite optimization
- Accessibility of solutions of operator equations by Newton-like methods
- Extension of Newton's method to nonlinear functions with values in a cone
- Convergence of Halley's method for operators with the bounded second Fréchet-derivative in Banach spaces
- Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization
- Convergence of Newton's method for systems of equations with constant rank derivatives
- Title not available (Why is that?)
- LOCAL CONVERGENCE ANALYSIS FOR A CERTAIN CLASS OF INEXACT METHODS
- On a new semilocal convergence analysis for the Jarratt method
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- ON THE "TERRA INCOGNITA" FOR THE NEWTON-KANTROVICH METHOD WITH APPLICATIONS
- Characterizations of Error Bounds for Convex Multifunctions on Banach Spaces
- LOCAL CONVERGENCE ANALYSIS OF INEXACT NEWTON-LIKE METHODS
- LOCAL CONVERGENCE ANALYSIS OF INEXACT NEWTON-LIKE METHODS
- On convergence of the Gauss-Newton method for convex composite optimization.
- Kantorovich's majorants principle for Newton's method
- Convergence criterion of Newton's method for singular systems with constant rank derivatives
Cited In (5)
- FIXED-POINT SEARCH WITH TWO ARBITRARY EQUAL PHASE SHIFTS FOR ANY NUMBER OF ITERATIONS
- Title not available (Why is that?)
- IMPROVING THE COMPUTATIONAL EFFICIENCY OF FIXED POINT ALGORITHMS
- Iteration functions in some nonsmooth optimization algorithms
- Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization
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)
