Circumscribed ellipsoid algorithm for fixed-point problems
From MaRDI portal
circumscribed ellipsoid algorithmfixed pointsNewton-Raphson methodnonexpanding functionsnumerical results
Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point theorems (47H10) Iterative procedures involving nonlinear operators (47J25) Numerical computation of solutions to systems of equations (65H10) Numerical solutions to equations with nonlinear operators (65J15) Complexity and performance of numerical algorithms (65Y20)
Recommendations
- An ellipsoid algorithm for the computation of fixed points
- scientific article; zbMATH DE number 3858834
- scientific article; zbMATH DE number 4131965
- An ellipsoid algorithm for equality-constrained nonlinear programs
- An Ellipsoidal Branch and Bound Algorithm for Global Optimization
- An improved ellipsoid method for solving convex differentiable optimization problems
- scientific article; zbMATH DE number 1283873
- scientific article; zbMATH DE number 5585899
- Solving ellipsoid-constrained integer least squares problems
- Interior point algorithm for linear programming problem and related inscribed ellipsoids
Cites work
- A Better Estimate for Fixed Points of Contractions
- A comparison of point and ball iterations in the contractive mapping case
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- A generalization of the Lefschetz fixed point theorem and detection of chaos
- A globally convergent algorithm for computing fixed points of C^2 maps
- A note on two fixed point problems
- A Numerical Verification Method for Solutions of Boundary Value Problems with Local Uniqueness by Banach's Fixed-Point Theorem
- A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures
- A recursive algorithm for the infinity-norm fixed point problem
- A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
- A two-dimensional bisection envelope algorithm for fixed points
- Algorithm 768: TENSOLVE
- Algorithm 825
- Algorithm 848
- An ellipsoid algorithm for the computation of fixed points
- Approximating fixed points of weakly contracting mappings
- Attractive cycles in the iteration of meromorphic functions
- Chaos and continued fractions
- Circumscribed ellipsoid algorithm for fixed-point problems
- Complexity of fixed points. I
- Exponential lower bounds for finding Brouwer fixed points
- Feature Article—The Ellipsoid Method: A Survey
- Homotopies for computation of fixed points
- Homotopies for computation of fixed points on unbounded regions
- scientific article; zbMATH DE number 3890210 (Why is no real title available?)
- scientific article; zbMATH DE number 4205881 (Why is no real title available?)
- scientific article; zbMATH DE number 47206 (Why is no real title available?)
- scientific article; zbMATH DE number 3487169 (Why is no real title available?)
- scientific article; zbMATH DE number 1971101 (Why is no real title available?)
- scientific article; zbMATH DE number 1997558 (Why is no real title available?)
- scientific article; zbMATH DE number 1395651 (Why is no real title available?)
- Ill-posed problems with a priori information
- On algorithms for discrete and approximate brouwer fixed points
- On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques
- Optimal solution of nonlinear equations
- Polynomial algorithms in linear programming
- Rank-one modification of the symmetric eigenproblem
- Some Modified Matrix Eigenvalue Problems
- The Approximation of Fixed Points of a Continuous Mapping
- The Core of an N Person Game
Cited in
(12)- Circumcentering the Douglas-Rachford method
- Dynamics of the Douglas-Rachford method for ellipses and p-spheres
- Approximating fixed points of weakly contracting mappings
- A computationally inexpensive algorithm for determining outer and inner enclosures of nonlinear mappings of ellipsoidal domains
- Deterministic and stochastic global optimization techniques for planar covering with ellipses problems
- An ellipsoid algorithm for the computation of fixed points
- A note on two fixed point problems
- scientific article; zbMATH DE number 6699444 (Why is no real title available?)
- Circumscribed ellipsoid algorithm for fixed-point problems
- scientific article; zbMATH DE number 880231 (Why is no real title available?)
- scientific article; zbMATH DE number 6452509 (Why is no real title available?)
- Finding elliptic Fekete points sets: Two numerical solution approaches
This page was built for publication: Circumscribed ellipsoid algorithm for fixed-point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3015053)
