>
Fa
|
Ar
|
En
foundations of computational mathematics
سال:2018 - دوره:18 - شماره:5
A Geometric Analysis of Phase Retrieval
- صفحه:1131-1198
Almost Every Real Quadratic Polynomial has a Poly-time Computable Julia Set
- صفحه:1233-1243
An Approximate Nerve Theorem
- صفحه:1245-1297
Calculus of the Exponent of Kurdyka–Łojasiewicz Inequality and Its Applications to Linear Convergence of First-Order Methods
- صفحه:1199-1232
Runge–Kutta Time Discretization of Nonlinear Parabolic Equations Studied via Discrete Maximal Parabolic Regularity
- صفحه:1109-1130
Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization
- صفحه:1073-1107
Copyright 2023
Islamic World Science Citation Center
All Rights Reserved
