Detecting infeasibility in infeasible-interior-point methods for optimization
From MaRDI portal
Publication:5482452
zbMATH Open1142.90499MaRDI QIDQ5482452FDOQ5482452
Publication date: 28 August 2006
Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51)
Cited In (11)
- Infeasibility Detection and SQP Methods for Nonlinear Optimization
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS
- Tailored presolve techniques in branch‐and‐bound method for fast mixed‐integer optimal control applications
- Status determination by interior-point methods for convex optimization problems in domain-driven form
- New stopping criteria for detecting infeasibility in conic optimization
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- Infeasible/feasible search trajectories and directional rounding in integer programming
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
- Dual versus primal-dual interior-point methods for linear and conic programming
Uses Software
Recommendations
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems 👍 👎
- Infeasibility Detection and SQP Methods for Nonlinear Optimization 👍 👎
- New stopping criteria for detecting infeasibility in conic optimization 👍 👎
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs 👍 👎
- Polynomiality of infeasible-interior-point algorithms for linear programming 👍 👎
This page was built for publication: Detecting infeasibility in infeasible-interior-point methods for optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5482452)
