QP

swMATH4811MaRDI QIDQ16973FDOQ16973

Author name not available (Why is that?)

Described by source

• Preprocessing for quadratic programming

Cited In (15)

• The problem of projecting the origin of Euclidean space onto the convex polyhedron
• Numerical methods for large-scale nonlinear optimization
• 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
• Robust preliminary analysis of large-scale linear model for optimal industrial investments
• GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
• An ADMM-based interior-point method for large-scale linear programming
• On the generalized Wolf problem: preprocessing of nonnegative large-scale linear programming problems with group constraints
• A numerical framework for diffusion-controlled bimolecular-reactive systems to enforce maximum principles and the non-negative constraint
• Robust learning with imperfect privileged information
• Domain reduction techniques for global NLP and MINLP optimization
• Global optimization on Stiefel manifolds: a computational approach
• An iterative working-set method for large-scale nonconvex quadratic programming
• Fast Core Pricing for Rich Advertising Auctions

This page was built for software: QP