Pages that link to "Item:Q1228114"
From MaRDI portal
The following pages link to The computation of fixed points and applications (Q1228114):
Displayed 49 items.
- On the geometry of paths generated by PL homotopy methods (Q2641223) (← links)
- On the existence and approximation of zeroes (Q3319694) (← links)
- A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm (Q3326743) (← links)
- $J'$: A New Triangulation of $R^n $ (Q3330396) (← links)
- The Middle-Cut Triangulations of the <i>n</i>-Cube (Q3331832) (← links)
- Assymptotically efficient triangulations of the d-cube∗ (Q3438984) (← links)
- General network equilibrium analysis (Q3674379) (← links)
- An algorithm for computing multivariable root loci by pivoting (Q3677589) (← links)
- An economic equilibrium model on a multicommodity network (Q3691365) (← links)
- On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials (Q3698168) (← links)
- A PL homotopy continuation method with the use of an odd map for the artificial level (Q3723607) (← links)
- Some NP-complete problems in quadratic and nonlinear programming (Q3778558) (← links)
- An algorithm to solve boundary value problems for differential iinclusions and applications in optimal control (Q3817203) (← links)
- A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization (Q3867585) (← links)
- Exploiting structure in piecewise-linear homotopy algorithms for solving equations (Q3872237) (← links)
- A new subdivision for computing fixed points with a homotopy algorithm (Q3880620) (← links)
- A class of simplicial restart fixed point algorithms without an extra dimension (Q3883945) (← links)
- Scalar labelings for homotopy paths (Q3890015) (← links)
- Borsuk's theorem through complementary pivoting (Q3890454) (← links)
- A variable-dimension simplicial algorithm for antipodal fixed-point theorems (Q3906317) (← links)
- The octahedral algorithm, a new simplicial fixed point algorithm (Q3930548) (← links)
- On accelerating PL continuation algorithms by predictor—corrector methods (Q3934152) (← links)
- Quadratically constrained quadratic programming: Some applications and a method for solution (Q3938843) (← links)
- An efficient simplicial algorithm for computing a zero of a convex union of smooth functions (Q3956756) (← links)
- A new variable dimension algorithm for the fixed point problem (Q3959753) (← links)
- Equilibria on a Congested Transportation Network (Q3967332) (← links)
- Triangulate flat cones on simplices (Q3974646) (← links)
- A modification of todd's triangulationJ 3 (Q4166141) (← links)
- Piecewise linear paths to minimize convex functions may not be monotonic (Q4196252) (← links)
- Finding all solutions to polynomial systems and other systems of equations (Q4197292) (← links)
- A restart algorithm for computing fixed points without an extra dimension (Q4198344) (← links)
- Fixed point theorems for discontinuous functions and applications (Q4377220) (← links)
- Red–green refinement of simplicial meshes in $d$ dimensions (Q4561371) (← links)
- A Lower Bound Technique for Triangulations of Simplotopes (Q4601211) (← links)
- Conjugate gradient predictor corrector method for solving large scale problems (Q4654022) (← links)
- A combined relaxation method for decomposable variational inequalities<sup>*</sup> (Q4704692) (← links)
- Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods (Q4749611) (← links)
- On the computational complexity of piecewise-linear homotopy algorithms (Q4749612) (← links)
- Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation (Q4805780) (← links)
- Best proximity problems for new types of $\mathcal{Z}$-proximal contractions with an application (Q5083511) (← links)
- On Finding Large Sets of Rewards in Two-Player ETP–ESP Games (Q5149575) (← links)
- Tracing Isomanifolds in \(\mathbb{R}\) <sup><i>d</i></sup> in Time Polynomial in <i>d</i> using Coxeter–Freudenthal–Kuhn Triangulations (Q5890033) (← links)
- Envy-free division of discrete cakes (Q5920328) (← links)
- Polyhedral methods for piecewise-linear functions. I: The lambda method (Q5929311) (← links)
- Computing an integer point of a class of convex sets. (Q5929418) (← links)
- Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm (Q5936075) (← links)
- Existence of balanced simplices on polytopes. (Q5953376) (← links)
- A note on vector labelling algorithm (Q5955859) (← links)
- (Q6062037) (← links)