Pages that link to "Item:Q266404"
From MaRDI portal
The following pages link to Mathematical Programming Computation (Q266404):
Displayed 50 items.
- Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs (Q2146450) (← links)
- Efficient unconstrained black box optimization (Q2146451) (← links)
- A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising (Q2175442) (← links)
- A branch-and-price algorithm for capacitated hypergraph vertex separation (Q2175443) (← links)
- Partial hyperplane activation for generalized intersection cuts (Q2175444) (← links)
- Exploiting sparsity for the min \(k\)-partition problem (Q2175445) (← links)
- Special issue forward: The 2018 mixed integer programming workshop (Q2195677) (← links)
- On integer and bilevel formulations for the \(k\)-vertex cut problem (Q2195678) (← links)
- On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679) (← links)
- \(K\)-adaptability in two-stage mixed-integer robust optimization (Q2195680) (← links)
- Outer approximation with conic certificates for mixed-integer convex problems (Q2195682) (← links)
- Split cuts from sparse disjunctions (Q2195684) (← links)
- Robust Euclidean embedding via EDM optimization (Q2220896) (← links)
- Generation techniques for linear programming instances with controllable properties (Q2220897) (← links)
- A rotation-based branch-and-price approach for the nurse scheduling problem (Q2220898) (← links)
- An adaptive primal-dual framework for nonsmooth convex minimization (Q2220901) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (Q2220913) (← links)
- A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery (Q2220914) (← links)
- Implementation of an interior point method with basis preconditioning (Q2220915) (← links)
- An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables (Q2220918) (← links)
- Asynchronous Lagrangian scenario decomposition (Q2246185) (← links)
- Hard to solve instances of the Euclidean traveling salesman problem (Q2246186) (← links)
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
- MiniCP: a lightweight solver for constraint programming (Q2246188) (← links)
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← links)
- A structure-conveying modelling language for mathematical and stochastic programming (Q2267351) (← links)
- Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
- The (not so) trivial lifting in two dimensions (Q2281447) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra (Q2281450) (← links)
- Optimizing over pure stationary equilibria in consensus stopping games (Q2281451) (← links)
- Certifiably optimal sparse principal component analysis (Q2293653) (← links)
- Solving quadratic programs to high precision using scaled iterative refinement (Q2293654) (← links)
- Solving equilibrium problems using extended mathematical programming (Q2293655) (← links)
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
- OAR lib: an open source arc routing library (Q2293658) (← links)
- A derivative-free Gauss-Newton method (Q2295977) (← links)
- Structure-driven fix-and-propagate heuristics for mixed integer programming (Q2295978) (← links)
- New exact approaches to row layout problems (Q2295979) (← links)
- Global optimization of nonconvex problems with multilinear intermediates (Q2356333) (← links)
- Alternating proximal gradient method for sparse nonnegative Tucker decomposition (Q2356334) (← links)
- Methods for convex and general quadratic programming (Q2356335) (← links)
- PySP: modeling and solving stochastic programs in Python (Q2392659) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- A penalty-interior-point algorithm for nonlinear constrained optimization (Q2392661) (← links)
- A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition (Q2392864) (← links)
- Cutting plane versus compact formulations for uncertain (integer) linear programs (Q2392865) (← links)
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866) (← links)