scientific article; zbMATH DE number 3535189
From MaRDI portal
Publication:4112523
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Research exposition (monographs, survey articles) pertaining to operator theory (47-02) Fixed-point theorems (47H10) Equations involving nonlinear operators (general) (47J05) Homotopy theory (55P99) Approximations in PL-topology (57Q55) Numerical computation of solutions to systems of equations (65H10) Linear programming (90C05) Convex programming (90C25) Nonlinear programming (90C30)
Cited in
(44)- Parametric fixed point algorithms with applications to economic policy analysis
- Complexity of fixed points. I
- Can we approximate zeros of functions with nonzero topological degree?
- Decomposability in fixed point computation with applications and acceleration techniques
- Nonlinear input-output model with piecewise affine coefficients
- A property of matrices with positive determinants
- Some n by dn linear complementarity problems
- Lower bounds on the worst-case complexity of some oracle algorithms
- A homotopy continuation method for solving normal equations
- The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\)
- A class of ``onto multifunctions
- Nonsingularity and symmetry for linear normal maps
- A continuous deformation algorithm for variational inequality problems on polytopes
- Newton's method for a class of nonsmooth functions
- Implementation of a continuation method for normal maps
- Piecewise linear methods for nonlinear equations and optimization
- \(P_ c\)-matrices and the linear complementarity problem
- Computing economic equilibria using benefit and surplus functions
- A structure-preserving pivotal method for affine variational inequalities
- On the solution of affine generalized Nash equilibrium problems with shared constraints by Lemke's method
- J': A New Triangulation of R^n
- A variable dimension fixed point algorithm and the orientation of simplices
- ‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems
- A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization
- Exploiting structure in piecewise-linear homotopy algorithms for solving equations
- Borsuk's theorem through complementary pivoting
- Homeomorphisms of triangulations with applications to computing fixed points
- Infinite retrogression in the Eaves—Saigal algorithm
- The octahedral algorithm, a new simplicial fixed point algorithm
- On accelerating PL continuation algorithms by predictor—corrector methods
- Combining a path method and parametric linear programming for the computation of competitive equilibria
- An efficient simplicial algorithm for computing a zero of a convex union of smooth functions
- A new variable dimension algorithm for the fixed point problem
- Pivotal methods for computing equilibrium points: Unified approach and new restart algorithm
- A PL homotopy for finding all the roots of a polynomial
- Piecewise linear paths to minimize convex functions may not be monotonic
- On branching numbers of normal manifolds
- Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
- On the computational complexity of piecewise-linear homotopy algorithms
- On the enumeration of subcells within hypercubes and its application to the Borsuk-Ulam theorem
- Estimates for piecewise linear approximations of implicitly defined manifolds
- Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Relationships of properties of piecewise affine maps over ordered fields
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4112523)