An Approximate Nerve Theorem.
- Published in:
- Foundations of Computational Mathematics, 2018, v. 18, n. 5, p. 1245, doi. 10.1007/s10208-017-9368-6
- By:
- Publication type:
- Article
Works matching IS 16153375 AND DT 2018 AND VI 18 AND IP 5
Results: 6
1
2
Almost Every Real Quadratic Polynomial has a Poly-time Computable Julia Set.
- Published in:
- Foundations of Computational Mathematics, 2018, v. 18, n. 5, p. 1233, doi. 10.1007/s10208-017-9367-7
- By:
- Publication type:
- Article
3
Calculus of the Exponent of Kurdyka-Łojasiewicz Inequality and Its Applications to Linear Convergence of First-Order Methods.
- Published in:
- Foundations of Computational Mathematics, 2018, v. 18, n. 5, p. 1199, doi. 10.1007/s10208-017-9366-8
- By:
- Publication type:
- Article
4
A Geometric Analysis of Phase Retrieval.
- Published in:
- Foundations of Computational Mathematics, 2018, v. 18, n. 5, p. 1131, doi. 10.1007/s10208-017-9365-9
- By:
- Publication type:
- Article
5
Runge-Kutta Time Discretization of Nonlinear Parabolic Equations Studied via Discrete Maximal Parabolic Regularity.
- Published in:
- Foundations of Computational Mathematics, 2018, v. 18, n. 5, p. 1109, doi. 10.1007/s10208-017-9364-x
- By:
- Publication type:
- Article
6
Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization.
- Published in:
- Foundations of Computational Mathematics, 2018, v. 18, n. 5, p. 1073, doi. 10.1007/s10208-017-9363-y
- By:
- Publication type:
- Article