Smooth over-parameterized solvers for non-smooth structured optimization.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 897, doi. 10.1007/s10107-022-01923-3
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2023 AND VI 201 AND IP 1/2
Results: 20
1
2
Constrained composite optimization and augmented Lagrangian methods.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 863, doi. 10.1007/s10107-022-01922-4
- By:
- Publication type:
- Article
3
Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 803, doi. 10.1007/s10107-022-01921-5
- By:
- Publication type:
- Article
4
Softmax policy gradient methods can take exponential time to converge.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 707, doi. 10.1007/s10107-022-01920-6
- By:
- Publication type:
- Article
5
A unified single-loop alternating gradient projection algorithm for nonconvex–concave and convex–nonconcave minimax problems.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 635, doi. 10.1007/s10107-022-01919-z
- By:
- Publication type:
- Article
6
Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 599, doi. 10.1007/s10107-022-01916-2
- By:
- Publication type:
- Article
7
A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 559, doi. 10.1007/s10107-022-01915-3
- By:
- Publication type:
- Article
8
Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 521, doi. 10.1007/s10107-022-01914-4
- By:
- Publication type:
- Article
9
Hessian averaging in stochastic Newton methods achieves superlinear convergence.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 473, doi. 10.1007/s10107-022-01913-5
- By:
- Publication type:
- Article
10
An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 409, doi. 10.1007/s10107-022-01912-6
- By:
- Publication type:
- Article
11
The landscape of the proximal point method for nonconvex–nonconcave minimax optimization.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 373, doi. 10.1007/s10107-022-01910-8
- By:
- Publication type:
- Article
12
Consistent approximations in composite optimization.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 339, doi. 10.1007/s10107-022-01909-1
- By:
- Publication type:
- Article
13
Supermodularity and valid inequalities for quadratic optimization with indicators.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 295, doi. 10.1007/s10107-022-01908-2
- By:
- Publication type:
- Article
14
An approximation algorithm for indefinite mixed integer quadratic programming.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 263, doi. 10.1007/s10107-022-01907-3
- By:
- Publication type:
- Article
15
Resolvent splitting for sums of monotone operators with minimal lifting.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 231, doi. 10.1007/s10107-022-01906-4
- By:
- Publication type:
- Article
16
Principled analyses and design of first-order methods with inexact proximal operators.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 185, doi. 10.1007/s10107-022-01903-7
- By:
- Publication type:
- Article
17
Faster first-order primal-dual methods for linear programming using restarts and sharpness.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 133, doi. 10.1007/s10107-022-01901-9
- By:
- Publication type:
- Article
18
Trace ratio optimization with an application to multi-view learning.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 97, doi. 10.1007/s10107-022-01900-w
- By:
- Publication type:
- Article
19
An elementary approach to tight worst case complexity analysis of gradient based methods.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 63, doi. 10.1007/s10107-022-01899-0
- By:
- Publication type:
- Article
20
A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 1, doi. 10.1007/s10107-022-01898-1
- By:
- Publication type:
- Article