A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems.
- Published in:
- Mathematical Programming, 2019, v. 175, n. 1/2, p. 503, doi. 10.1007/s10107-018-1253-9
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2019 AND VI 175 AND IP 1/2
Results: 15
1
2
Stochastic dual dynamic integer programming.
- Published in:
- Mathematical Programming, 2019, v. 175, n. 1/2, p. 461, doi. 10.1007/s10107-018-1249-5
- By:
- Publication type:
- Article
3
Submodular functions: from discrete to continuous domains.
- Published in:
- Mathematical Programming, 2019, v. 175, n. 1/2, p. 419, doi. 10.1007/s10107-018-1248-6
- By:
- Publication type:
- Article
4
A block symmetric Gauss–Seidel decomposition theorem for convex composite quadratic programming and its applications.
- Published in:
- Mathematical Programming, 2019, v. 175, n. 1/2, p. 395, doi. 10.1007/s10107-018-1247-7
- By:
- Publication type:
- Article
5
Error bounds for monomial convexification in polynomial optimization.
- Published in:
- Mathematical Programming, 2019, v. 175, n. 1/2, p. 355, doi. 10.1007/s10107-018-1246-8
- By:
- Publication type:
- Article
6
Nearly linear-time packing and covering LP solvers: Achieving width-independence and -convergence.
- Published in:
- Mathematical Programming, 2019, v. 175, n. 1/2, p. 307, doi. 10.1007/s10107-018-1244-x
- By:
- Publication type:
- Article
7
Routing optimization with time windows under uncertainty.
- Published in:
- Mathematical Programming, 2019, v. 175, n. 1/2, p. 263, doi. 10.1007/s10107-018-1243-y
- By:
- Publication type:
- Article
8
Rates of convergence for inexact Krasnosel'skii–Mann iterations in Banach spaces.
- Published in:
- Mathematical Programming, 2019, v. 175, n. 1/2, p. 241, doi. 10.1007/s10107-018-1240-1
- By:
- Publication type:
- Article
9
Polytopes associated with symmetry handling.
- Published in:
- Mathematical Programming, 2019, v. 175, n. 1/2, p. 197, doi. 10.1007/s10107-018-1239-7
- By:
- Publication type:
- Article
10
On partial smoothness, tilt stability and the VU-decomposition.
- Published in:
- Mathematical Programming, 2019, v. 175, n. 1/2, p. 155, doi. 10.1007/s10107-018-1238-8
- By:
- Publication type:
- Article
11
Scaling, proximity, and optimization of integrally convex functions.
- Published in:
- Mathematical Programming, 2019, v. 175, n. 1/2, p. 119, doi. 10.1007/s10107-018-1234-z
- By:
- Publication type:
- Article
12
On representing the positive semidefinite cone using the second-order cone.
- Published in:
- Mathematical Programming, 2019, v. 175, n. 1/2, p. 109, doi. 10.1007/s10107-018-1233-0
- By:
- Publication type:
- Article
13
Linear convergence of first order methods for non-strongly convex optimization.
- Published in:
- Mathematical Programming, 2019, v. 175, n. 1/2, p. 69, doi. 10.1007/s10107-018-1232-1
- By:
- Publication type:
- Article
14
On intersection of two mixing sets with applications to joint chance-constrained programs.
- Published in:
- Mathematical Programming, 2019, v. 175, n. 1/2, p. 29, doi. 10.1007/s10107-018-1231-2
- By:
- Publication type:
- Article
15
Eventual convexity of probability constraints with elliptical distributions.
- Published in:
- Mathematical Programming, 2019, v. 175, n. 1/2, p. 1, doi. 10.1007/s10107-018-1230-3
- By:
- Publication type:
- Article