Pages that link to "Item:Q163006"
From MaRDI portal
The following pages link to Mathematical Programming. Series A. Series B (Q163006):
Displaying 50 items.
- Second-order cone programming (Q1411628) (← links)
- Semidefinite programming relaxations for semialgebraic problems (Q1424271) (← links)
- Robust discrete optimization and network flows (Q1424278) (← links)
- Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices (Q1424303) (← links)
- Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods (Q1646571) (← links)
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices (Q1646573) (← links)
- When are static and adjustable robust optimization problems with constraint-wise uncertainty equivalent? (Q1659683) (← links)
- Two-stage stochastic variational inequalities: an ERM-solution procedure (Q1680962) (← links)
- Data-driven robust optimization (Q1702776) (← links)
- Binary decision rules for multistage adaptive mixed-integer optimization (Q1702781) (← links)
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint (Q1717222) (← links)
- Global optimization in Hilbert space (Q1717227) (← links)
- Maximum a posteriori estimators as a limit of Bayes estimators (Q1739031) (← links)
- Extended neighborhood: Definition and characterization (Q1764249) (← links)
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs (Q1771306) (← links)
- Global solution of semi-infinite programs (Q1780954) (← links)
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations (Q1785197) (← links)
- New algorithms for maximum disjoint paths based on tree-likeness (Q1785205) (← links)
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem (Q1825115) (← links)
- The mathematics of playing golf, or: A new class of difficult nonlinear mixed integer programs (Q1849260) (← links)
- History of mathematical programming in the USSR: Analyzing the phenomenon (Q1849523) (← links)
- The many facets of linear programming (Q1849524) (← links)
- A globally convergent primal-dual interior-point filter method for nonlinear programming (Q1881567) (← links)
- A new branch-and-cut algorithm for the capacitated vehicle routing problem (Q1881569) (← links)
- An algebraic geometry algorithm for scheduling in presence of setups and correlated demands (Q1906277) (← links)
- Shortest paths algorithms: Theory and experimental evaluation (Q1919099) (← links)
- A unifying geometric solution framework and complexity analysis for variational inequalities (Q1919807) (← links)
- The Fermat-Weber location problem revisited (Q1924059) (← links)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- Global error bounds for piecewise convex polynomials (Q1942267) (← links)
- On the separation of maximally violated mod-\(k\) cuts (Q1970294) (← links)
- Distributionally robust optimization with polynomial densities: theory, models and algorithms (Q2189441) (← links)
- Theoretical and empirical analysis of trading activity (Q2189447) (← links)
- Small and strong formulations for unions of convex sets from the Cayley embedding (Q2316612) (← links)
- An algorithm for nonsmooth optimization by successive piecewise linearization (Q2316623) (← links)
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs (Q2330644) (← links)
- The two-level diameter constrained spanning tree problem (Q2340278) (← links)
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction (Q2364497) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- Blessing of massive scale: spatial graphical model estimation with a total cardinality constraint approach (Q2425168) (← links)
- Constraint augmentation in pseudo-singularly perturbed linear programs (Q2429463) (← links)
- Geometry of interpolation sets in derivative free optimization (Q2467163) (← links)
- Exploring the relationship between max-cut and stable set relaxations (Q2490329) (← links)
- Tractable approximations to robust conic optimization problems (Q2492681) (← links)
- Robust global optimization with polynomials (Q2492692) (← links)
- A note on the Lipschitz continuity of the gradient of the squared norm of the matrix-valued Fischer-Burmeister function (Q2492709) (← links)
- Assessing solution quality in stochastic programs (Q2502212) (← links)
- Automatic Dantzig-Wolfe reformulation of mixed integer programs (Q2515047) (← links)
- Error bounds for convex differentiable inequality systems in Banach spaces (Q2576731) (← links)
