Pages that link to "Item:Q1412170"
From MaRDI portal
The following pages link to Advanced preprocessing techniques for linear and quadratic programming (Q1412170):
Displayed 19 items.
- Nonlinear transformations for the simplification of unconstrained nonlinear optimization problems (Q301110) (← links)
- The practical behavior of the homogeneous self-dual formulations in interior point methods (Q302143) (← links)
- On sparse matrix orderings in interior point methods (Q402236) (← links)
- A heuristic algorithm for resource allocation/reallocation problem (Q410767) (← links)
- Regularization techniques in interior point methods (Q432801) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Design of planar articulated mechanisms using branch and bound (Q1780959) (← links)
- Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
- A triangulation and fill-reducing initialization procedure for the simplex algorithm (Q2062318) (← links)
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms (Q2642636) (← links)
- Detecting ``dense'' columns in interior point methods for linear programs (Q2643620) (← links)
- Exploiting hardware capabilities in interior point methods (Q2815515) (← links)
- A heuristic approach for identification of redundant constraints in linear programming models (Q3437363) (← links)
- An ADMM-based interior-point method for large-scale linear programming (Q4999335) (← links)
- Screening Rules and its Complexity for Active Set Identification (Q5026418) (← links)
- Primal-Dual Path-Following Methods and the Trust-Region Updating Strategy for Linear Programming with Noisy Data (Q5090518) (← links)
- Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints (Q5175471) (← links)
- Preprocessing and Regularization for Degenerate Semidefinite Programs (Q5746441) (← links)
- Revisiting degeneracy, strict feasibility, stability, in linear programming (Q6113350) (← links)