Preprocessing for quadratic programming
From MaRDI portal
Publication:1890305
DOI10.1007/s10107-003-0487-2zbMath1146.90491OpenAlexW1998899775WikidataQ58185814 ScholiaQ58185814MaRDI QIDQ1890305
Phillipe L. Toint, Nick I. M. Gould
Publication date: 3 January 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://cds.cern.ch/record/557159
Related Items
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, Trajectory-following methods for large-scale degenerate convex quadratic programming, A numerical framework for diffusion-controlled bimolecular-reactive systems to enforce maximum principles and the non-negative constraint, The problem of projecting the origin of Euclidean space onto the convex polyhedron, 3D diffeomorphic image registration with Cauchy–Riemann constraint and lower bounded deformation divergence, Joint group and pairwise localities embedding for feature extraction, Domain reduction techniques for global NLP and MINLP optimization, On the generalized Wolf problem: preprocessing of nonnegative large-scale linear programming problems with group constraints, Preprocessing and Regularization for Degenerate Semidefinite Programs, Robust preliminary analysis of large-scale linear model for optimal industrial investments, QP, Robust learning with imperfect privileged information, A triangulation and fill-reducing initialization procedure for the simplex algorithm, An ADMM-based interior-point method for large-scale linear programming, Entropy Satisfying Schemes for Computing Selection Dynamics in Competitive Interactions, An iterative working-set method for large-scale nonconvex quadratic programming, Fast Core Pricing for Rich Advertising Auctions
Uses Software
