Pages that link to "Item:Q266404"
From MaRDI portal
The following pages link to Mathematical Programming Computation (Q266404):
Displaying 50 items.
- 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)
- Trajectory-following methods for large-scale degenerate convex quadratic programming (Q2392932) (← links)
- Efficient block-coordinate descent algorithms for the group Lasso (Q2392933) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- Parallel stochastic gradient algorithms for large-scale matrix completion (Q2392935) (← links)
- Computing convex hulls and counting integer points with \texttt{polymake} (Q2398105) (← links)
- Fast separation for the three-index assignment problem (Q2398106) (← links)
- Improved branch-cut-and-price for capacitated vehicle routing (Q2398107) (← links)
- On efficiently combining limited-memory and trust-region techniques (Q2398109) (← links)
- The strength of multi-row models (Q2516350) (← links)
- Generalized alternating direction method of multipliers: new theoretical insights and applications (Q2516351) (← links)
- Solving network design problems via iterative aggregation (Q2516352) (← links)
- On solving a hard quadratic 3-dimensional assignment problem (Q2516353) (← links)
- A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty (Q6062880) (← links)
- Computing minimum-volume enclosing ellipsoids (Q6062882) (← links)
- A hierarchy of spectral relaxations for polynomial optimization (Q6062883) (← links)
- A computational study of perspective cuts (Q6062884) (← links)
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886) (← links)
- Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization (Q6095733) (← links)
- Faster exact solution of sparse maxcut and QUBO problems (Q6095734) (← links)
- Parallel and distributed asynchronous adaptive stochastic gradient methods (Q6095736) (← links)
- Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems (Q6095737) (← links)
- Efficient MIP techniques for computing the relaxation complexity (Q6095738) (← links)
- JuMP 1.0: recent improvements to a modeling language for mathematical optimization (Q6095739) (← links)
- Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds (Q6102856) (← links)
- Performance enhancements for a generic conic interior point algorithm (Q6102857) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
- A data driven Dantzig-Wolfe decomposition framework (Q6102860) (← links)
- A dynamic programming approach for generalized nearly isotonic optimization (Q6102862) (← links)
- A memetic procedure for global multi-objective optimization (Q6175704) (← links)
- A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705) (← links)
- Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization (Q6175706) (← links)
