Pages that link to "Item:Q266404"
From MaRDI portal
The following pages link to Mathematical Programming Computation (Q266404):
Displaying 50 items.
- Parallelizing the dual revised simplex method (Q1646685) (← links)
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems (Q1688449) (← links)
- Extended formulations in mixed integer conic quadratic programming (Q1688453) (← links)
- New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem (Q1688454) (← links)
- Customizing the solution process of COIN-OR's linear solvers with python (Q1694292) (← links)
- Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation (Q1694294) (← links)
- An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix (Q1694296) (← links)
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
- A branch-and-bound algorithm for instrumental variable quantile regression (Q1697970) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- Lifted collocation integrators for direct optimal control in ACADO toolkit (Q1697973) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
- Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
- SCIP-Jack -- a solver for STP and variants with parallelization extensions (Q1699618) (← links)
- Swap-vertex based neighborhood for Steiner tree problems (Q1699620) (← links)
- Cubic regularization in symmetric rank-1 quasi-Newton methods (Q1741108) (← links)
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study (Q1741111) (← links)
- A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming (Q1741112) (← links)
- 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)
