Pages that link to "Item:Q266404"
From MaRDI portal
The following pages link to Mathematical Programming Computation (Q266404):
Displayed 50 items.
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem (Q1741115) (← links)
- RBFOpt: an open-source library for black-box optimization with costly function evaluations (Q1741116) (← links)
- ADMM for the SDP relaxation of the QAP (Q1741118) (← links)
- Learning customized and optimized lists of rules with mathematical programming (Q1741119) (← links)
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming (Q1741120) (← links)
- CasADi: a software framework for nonlinear optimization and optimal control (Q1741124) (← links)
- A computational comparison of symmetry handling methods for mixed integer programs (Q1741126) (← links)
- Computing feasible points for binary MINLPs with MPECs (Q1741127) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
- Enumeration of 2-level polytopes (Q1741129) (← links)
- A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
- Templates for convex cone problems with applications to sparse signal recovery (Q1762456) (← links)
- Optimal linear arrangements using betweenness variables (Q1762457) (← links)
- Rounding-based heuristics for nonconvex MINLPS (Q1762458) (← links)
- Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
- Fast Fourier optimization (Q1762460) (← links)
- A primal-dual regularized interior-point method for convex quadratic programs (Q1762462) (← links)
- Optimal sensitivity based on IPOPT (Q1946920) (← links)
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm (Q1946921) (← links)
- Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922) (← links)
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization (Q1946925) (← links)
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (Q1947198) (← links)
- The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199) (← links)
- Implementation of a unimodularity test (Q1947200) (← links)
- Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints (Q1947201) (← links)
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library (Q2062317) (← links)
- A triangulation and fill-reducing initialization procedure for the simplex algorithm (Q2062318) (← links)
- Design and implementation of a modular interior-point solver for linear optimization (Q2062319) (← links)
- Deterministic global optimization with Gaussian processes embedded (Q2062323) (← links)
- An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization (Q2062324) (← links)
- A benders squared \((B^2)\) framework for infinite-horizon stochastic linear programs (Q2063190) (← links)
- Benders decomposition with adaptive oracles for large scale optimization (Q2063193) (← links)
- A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs (Q2063194) (← links)
- Computational aspects of infeasibility analysis in mixed integer programming (Q2063195) (← links)
- A penalized method of alternating projections for weighted low-rank Hankel matrix optimization (Q2088963) (← links)
- \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria (Q2088964) (← links)
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs (Q2088967) (← links)
- Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization (Q2088969) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem (Q2099494) (← links)
- A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl (Q2099497) (← links)
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
- Scalable branching on dual decomposition of stochastic mixed-integer programming problems (Q2125568) (← links)
- Optimal patchings for consecutive ones matrices (Q2125569) (← links)
- Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
- On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees (Q2125571) (← links)
- \texttt{acados} -- a modular open-source framework for fast embedded optimal control (Q2125577) (← links)
- Adaptive large neighborhood search for mixed integer programming (Q2146445) (← links)
- An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems (Q2146447) (← links)
- LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)