A first order method for finding minimal norm-like solutions of convex optimization problems.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 25, doi. 10.1007/s10107-013-0708-2
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2014 AND VI 147 AND IP 1/2
Results: 21
1
2
Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 47, doi. 10.1007/s10107-013-0709-1
- By:
- Publication type:
- Article
3
Tree metrics and edge-disjoint $$S$$ -paths.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 81, doi. 10.1007/s10107-013-0713-5
- By:
- Publication type:
- Article
4
Iterative hard thresholding methods for $$l_0$$ regularized convex cone programming.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 125, doi. 10.1007/s10107-013-0714-4
- By:
- Publication type:
- Article
5
On the bilinearity rank of a proper cone and Lyapunov-like transformations.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 155, doi. 10.1007/s10107-013-0715-3
- By:
- Publication type:
- Article
6
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 171, doi. 10.1007/s10107-013-0716-2
- By:
- Publication type:
- Article
7
Strongly regular nonsmooth generalized equations.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 581, doi. 10.1007/s10107-013-0717-1
- By:
- Publication type:
- Article
8
A simple randomised algorithm for convex optimisation.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 207, doi. 10.1007/s10107-013-0718-0
- By:
- Publication type:
- Article
9
Network congestion control with Markovian multipath routing.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 231, doi. 10.1007/s10107-013-0719-z
- By:
- Publication type:
- Article
10
The divergence of the BFGS and Gauss Newton methods.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 253, doi. 10.1007/s10107-013-0720-6
- By:
- Publication type:
- Article
11
Iterative reweighted minimization methods for $$l_p$$ regularized unconstrained nonlinear programming.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 277, doi. 10.1007/s10107-013-0722-4
- By:
- Publication type:
- Article
12
The Hirsch Conjecture for the fractional stable set polytope.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 309, doi. 10.1007/s10107-013-0723-3
- By:
- Publication type:
- Article
13
Computing the nearest Euclidean distance matrix with low embedding dimensions.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 351, doi. 10.1007/s10107-013-0726-0
- By:
- Publication type:
- Article
14
Threshold Boolean form for joint probabilistic constraints with random technology matrix.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 391, doi. 10.1007/s10107-013-0728-y
- By:
- Publication type:
- Article
15
Guaranteed clustering and biclustering via semidefinite programming.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 429, doi. 10.1007/s10107-013-0729-x
- By:
- Publication type:
- Article
16
Optimality, identifiability, and sensitivity.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 467, doi. 10.1007/s10107-013-0730-4
- By:
- Publication type:
- Article
17
On matching cover of graphs.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 499, doi. 10.1007/s10107-013-0731-3
- By:
- Publication type:
- Article
18
A Frank-Wolfe type theorem for nondegenerate polynomial programs.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 519, doi. 10.1007/s10107-013-0732-2
- By:
- Publication type:
- Article
19
First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 539, doi. 10.1007/s10107-013-0735-z
- By:
- Publication type:
- Article
20
The numerical solution of Newton's problem of least resistance.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 331, doi. 10.1007/s10107-014-0756-2
- By:
- Publication type:
- Article
21
An efficient polynomial time approximation scheme for load balancing on uniformly related machines.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 1, doi. 10.1007/s10107-013-0706-4
- By:
- Publication type:
- Article