Unit stepsize for the Newton method close to critical solutions.
- Published in:
- Mathematical Programming, 2021, v. 187, n. 1/2, p. 697, doi. 10.1007/s10107-020-01496-z
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2021 AND VI 187 AND IP 1/2
Results: 20
1
2
Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting.
- Published in:
- Mathematical Programming, 2021, v. 187, n. 1/2, p. 653, doi. 10.1007/s10107-020-01495-0
- By:
- Publication type:
- Article
3
Convergent upper bounds in global minimization with nonlinear equality constraints.
- Published in:
- Mathematical Programming, 2021, v. 187, n. 1/2, p. 617, doi. 10.1007/s10107-020-01493-2
- By:
- Publication type:
- Article
4
Regional complexity analysis of algorithms for nonconvex smooth optimization.
- Published in:
- Mathematical Programming, 2021, v. 187, n. 1/2, p. 579, doi. 10.1007/s10107-020-01492-3
- By:
- Publication type:
- Article
5
Inexact stochastic mirror descent for two-stage nonlinear stochastic programs.
- Published in:
- Mathematical Programming, 2021, v. 187, n. 1/2, p. 533, doi. 10.1007/s10107-020-01490-5
- By:
- Publication type:
- Article
6
Dynamic stochastic approximation for multi-stage stochastic optimization.
- Published in:
- Mathematical Programming, 2021, v. 187, n. 1/2, p. 487, doi. 10.1007/s10107-020-01489-y
- By:
- Publication type:
- Article
7
A sequential homotopy method for mathematical programming problems.
- Published in:
- Mathematical Programming, 2021, v. 187, n. 1/2, p. 459, doi. 10.1007/s10107-020-01488-z
- By:
- Publication type:
- Article
8
Distributed stochastic gradient tracking methods.
- Published in:
- Mathematical Programming, 2021, v. 187, n. 1/2, p. 409, doi. 10.1007/s10107-020-01487-0
- By:
- Publication type:
- Article
9
Analysis of biased stochastic gradient descent using sequential semidefinite programs.
- Published in:
- Mathematical Programming, 2021, v. 187, n. 1/2, p. 383, doi. 10.1007/s10107-020-01486-1
- By:
- Publication type:
- Article
10
Convex hull results for generalizations of the constant capacity single node flow set.
- Published in:
- Mathematical Programming, 2021, v. 187, n. 1/2, p. 351, doi. 10.1007/s10107-020-01481-6
- By:
- Publication type:
- Article
11
Generalized stochastic Frank–Wolfe algorithm with stochastic "substitute" gradient for structured convex optimization.
- Published in:
- Mathematical Programming, 2021, v. 187, n. 1/2, p. 317, doi. 10.1007/s10107-020-01480-7
- By:
- Publication type:
- Article
12
Chebyshev center of the intersection of balls: complexity, relaxation and approximation.
- Published in:
- Mathematical Programming, 2021, v. 187, n. 1/2, p. 287, doi. 10.1007/s10107-020-01479-0
- By:
- Publication type:
- Article
13
Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs.
- Published in:
- Mathematical Programming, 2021, v. 187, n. 1/2, p. 253, doi. 10.1007/s10107-020-01478-1
- By:
- Publication type:
- Article
14
Facets, weak facets, and extreme functions of the Gomory–Johnson infinite group problem.
- Published in:
- Mathematical Programming, 2021, v. 187, n. 1/2, p. 195, doi. 10.1007/s10107-020-01477-2
- By:
- Publication type:
- Article
15
Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions.
- Published in:
- Mathematical Programming, 2021, v. 187, n. 1/2, p. 151, doi. 10.1007/s10107-020-01476-3
- By:
- Publication type:
- Article
16
Outer approximation for integer nonlinear programs via decision diagrams.
- Published in:
- Mathematical Programming, 2021, v. 187, n. 1/2, p. 111, doi. 10.1007/s10107-020-01475-4
- By:
- Publication type:
- Article
17
New characterizations of Hoffman constants for systems of linear constraints.
- Published in:
- Mathematical Programming, 2021, v. 187, n. 1/2, p. 79, doi. 10.1007/s10107-020-01473-6
- By:
- Publication type:
- Article
18
High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms.
- Published in:
- Mathematical Programming, 2021, v. 187, n. 1/2, p. 47, doi. 10.1007/s10107-020-01470-9
- By:
- Publication type:
- Article
19
A simplex algorithm for rational cp-factorization.
- Published in:
- Mathematical Programming, 2021, v. 187, n. 1/2, p. 25, doi. 10.1007/s10107-020-01467-4
- By:
- Publication type:
- Article
20
An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity.
- Published in:
- Mathematical Programming, 2021, v. 187, n. 1/2, p. 1, doi. 10.1007/s10107-020-01466-5
- By:
- Publication type:
- Article