Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 587, doi. 10.1007/s10107-011-0498-3
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2013 AND VI 137 AND IP 1/2
Results: 25
1
2
Distributionally robust joint chance constraints with second-order moment information.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 167, doi. 10.1007/s10107-011-0494-7
- By:
- Publication type:
- Article
3
The rank of (mixed-) integer polyhedra.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 593, doi. 10.1007/s10107-011-0500-0
- By:
- Publication type:
- Article
4
NP-hardness of deciding convexity of quartic polynomials and related problems.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 453, doi. 10.1007/s10107-011-0499-2
- By:
- Publication type:
- Article
5
Generalized intersection cuts and a new cut generating paradigm.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 19, doi. 10.1007/s10107-011-0483-x
- By:
- Publication type:
- Article
6
Global error bounds for piecewise convex polynomials.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 37, doi. 10.1007/s10107-011-0481-z
- By:
- Publication type:
- Article
7
Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 257, doi. 10.1007/s10107-011-0488-5
- By:
- Publication type:
- Article
8
On stress matrices of ( d + 1)-lateration frameworks in general position.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 1, doi. 10.1007/s10107-011-0480-0
- By:
- Publication type:
- Article
9
Algorithms for highly symmetric linear and integer programs.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 65, doi. 10.1007/s10107-011-0487-6
- By:
- Publication type:
- Article
10
Convex envelopes generated from finitely many compact convex sets.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 371, doi. 10.1007/s10107-011-0496-5
- By:
- Publication type:
- Article
11
The tracial moment problem and trace-optimization of polynomials.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 557, doi. 10.1007/s10107-011-0505-8
- By:
- Publication type:
- Article
12
A quasi-Newton strategy for the sSQP method for variational inequality and optimization problems.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 199, doi. 10.1007/s10107-011-0493-8
- By:
- Publication type:
- Article
13
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 91, doi. 10.1007/s10107-011-0484-9
- By:
- Publication type:
- Article
14
An exact Jacobian SDP relaxation for polynomial optimization.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 225, doi. 10.1007/s10107-011-0489-4
- By:
- Publication type:
- Article
15
Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 503, doi. 10.1007/s10107-011-0506-7
- By:
- Publication type:
- Article
16
The effect of calmness on the solution set of systems of nonlinear equations.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 155, doi. 10.1007/s10107-011-0486-7
- By:
- Publication type:
- Article
17
Separation and relaxation for cones of quadratic forms.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 343, doi. 10.1007/s10107-011-0495-6
- By:
- Publication type:
- Article
18
Separating doubly nonnegative and completely positive matrices.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 131, doi. 10.1007/s10107-011-0485-8
- By:
- Publication type:
- Article
19
On the global convergence of a generalized iterative procedure for the minisum location problem with ℓ distances for p > 2.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 477, doi. 10.1007/s10107-011-0501-z
- By:
- Publication type:
- Article
20
On the use of piecewise linear models in nonlinear programming.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 289, doi. 10.1007/s10107-011-0492-9
- By:
- Publication type:
- Article
21
An exact algorithm for graph partitioning.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 531, doi. 10.1007/s10107-011-0503-x
- By:
- Publication type:
- Article
22
Improved lower bounds and exact algorithm for the capacitated arc routing problem.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 409, doi. 10.1007/s10107-011-0497-4
- By:
- Publication type:
- Article
23
A note on polylinking flow networks.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 601, doi. 10.1007/s10107-011-0502-y
- By:
- Publication type:
- Article
24
n-Fold integer programming in cubic time.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 325, doi. 10.1007/s10107-011-0490-y
- By:
- Publication type:
- Article
25
A bound for the number of different basic solutions generated by the simplex method.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 579, doi. 10.1007/s10107-011-0482-y
- By:
- Publication type:
- Article