The following pages link to (Q5482452):
Displaying 9 items.
- Infeasible/feasible search trajectories and directional rounding in integer programming (Q930155) (← links)
- New stopping criteria for detecting infeasibility in conic optimization (Q1024728) (← links)
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension (Q1029621) (← links)
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization (Q1926632) (← links)
- Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
- Dual versus primal-dual interior-point methods for linear and conic programming (Q2467157) (← links)
- Infeasibility Detection and SQP Methods for Nonlinear Optimization (Q3083287) (← links)
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods (Q4292667) (← links)
- Tailored presolve techniques in branch‐and‐bound method for fast mixed‐integer optimal control applications (Q6180277) (← links)
