Works matching IS 00255610 AND DT 2016 AND VI 160 AND IP 1/2
Results: 20
On the multiplier-penalty-approach for quasi-variational inequalities.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 33, doi. 10.1007/s10107-015-0973-3
- By:
- Publication type:
- Article
A copositive formulation for the stability number of infinite graphs.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 65, doi. 10.1007/s10107-015-0974-2
- By:
- Publication type:
- Article
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 85, doi. 10.1007/s10107-015-0975-1
- By:
- Publication type:
- Article
Second order analysis of control-affine problems with scalar state constraint.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 115, doi. 10.1007/s10107-015-0976-0
- By:
- Publication type:
- Article
Sparse sums of squares on finite abelian groups and improved semidefinite lifts.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 149, doi. 10.1007/s10107-015-0977-z
- By:
- Publication type:
- Article
The impact of the existence of multiple adjustable robust solutions.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 531, doi. 10.1007/s10107-016-0978-6
- By:
- Publication type:
- Article
Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 193, doi. 10.1007/s10107-016-0980-z
- By:
- Publication type:
- Article
Approximation algorithms for inventory problems with submodular or routing costs.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 225, doi. 10.1007/s10107-016-0981-y
- By:
- Publication type:
- Article
On the polyhedrality of cross and quadrilateral closures.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 245, doi. 10.1007/s10107-016-0982-x
- By:
- Publication type:
- Article
A bundle-free implicit programming approach for a class of elliptic MPECs in function space.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 271, doi. 10.1007/s10107-016-0983-9
- By:
- Publication type:
- Article
On the worst case performance of the steepest descent algorithm for quadratic functions.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 307, doi. 10.1007/s10107-016-0984-8
- By:
- Publication type:
- Article
An optimal variant of Kelley's cutting-plane method.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 321, doi. 10.1007/s10107-016-0985-7
- By:
- Publication type:
- Article
Constraint qualifications and optimality conditions for optimization problems with cardinality constraints.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 353, doi. 10.1007/s10107-016-0986-6
- By:
- Publication type:
- Article
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 379, doi. 10.1007/s10107-016-0987-5
- By:
- Publication type:
- Article
Average case polyhedral complexity of the maximum stable set problem.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 407, doi. 10.1007/s10107-016-0989-3
- By:
- Publication type:
- Article
Approximating the little Grothendieck problem over the orthogonal and unitary groups.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 433, doi. 10.1007/s10107-016-0993-7
- By:
- Publication type:
- Article
Newton's method may fail to recognize proximity to optimal points in constrained optimization.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 547, doi. 10.1007/s10107-016-0994-6
- By:
- Publication type:
- Article
Some LCPs solvable in strongly polynomial time with Lemke's algorithm.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 477, doi. 10.1007/s10107-016-0996-4
- By:
- Publication type:
- Article
Practical inexact proximal quasi-Newton method with global complexity analysis.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 495, doi. 10.1007/s10107-016-0997-3
- By:
- Publication type:
- Article
Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 1, doi. 10.1007/s10107-015-0969-z
- By:
- Publication type:
- Article