Preprocessing for quadratic programming
From MaRDI portal
Recommendations
- Advanced preprocessing techniques for linear and quadratic programming
- Transformation-based preprocessing for mixed-integer quadratic programs
- Linear transformation based solution methods for non-convex mixed integer quadratic programs
- Preprocessing complementarity problems
- Efficient preprocessing for VLSI optimization problems
Cited in
(22)- The problem of projecting the origin of Euclidean space onto the convex polyhedron
- Transformation-based preprocessing for mixed-integer quadratic programs
- Preprocessing and regularization for degenerate semidefinite programs
- Trajectory-following methods for large-scale degenerate convex quadratic programming
- On enforcing maximum principles and achieving element-wise species balance for advection-diffusion-reaction equations under the finite element method
- A smoothing SQP framework for a class of composite L_q minimization over polyhedron
- Linear transformation based solution methods for non-convex mixed integer quadratic programs
- 3D diffeomorphic image registration with Cauchy–Riemann constraint and lower bounded deformation divergence
- Joint group and pairwise localities embedding for feature extraction
- Entropy Satisfying Schemes for Computing Selection Dynamics in Competitive Interactions
- QP
- A triangulation and fill-reducing initialization procedure for the simplex algorithm
- Robust preliminary analysis of large-scale linear model for optimal industrial investments
- Advanced preprocessing techniques for linear and quadratic programming
- On the generalized Wolf problem: preprocessing of nonnegative large-scale linear programming problems with group constraints
- An ADMM-based interior-point method for large-scale linear programming
- A numerical framework for diffusion-controlled bimolecular-reactive systems to enforce maximum principles and the non-negative constraint
- Preprocessing for DQBF
- Robust learning with imperfect privileged information
- Domain reduction techniques for global NLP and MINLP optimization
- An iterative working-set method for large-scale nonconvex quadratic programming
- Fast Core Pricing for Rich Advertising Auctions
This page was built for publication: Preprocessing for quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1890305)
