scientific article; zbMATH DE number 1199796

zbMATH Open0909.65036MaRDI QIDQ4211289FDOQ4211289

Authors: Qin Ni 

Publication date: 7 April 1999

Title of this publication is not available (Why is that?)

Recommendations

• On the Solution of Large Quadratic Programming Problems with Bound Constraints
• A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems
• scientific article; zbMATH DE number 1383441
• A class of methods for solving large, convex quadratic programs subject to box constraints
• Algorithms for bound constrained quadratic programming problems

zbMATH Keywords

convergencenumerical examplesprojected gradient methodconjugate gradient methodlarge scale quadratic programslarge bound constrained quadratic programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Cited In (9)

• Title not available (Why is that?)
• An active set limited memory BFGS algorithm for bound constrained optimization
• A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems
• An active-set projected trust region algorithm for box constrained optimization problems
• A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
• A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint
• Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization
• A limited-memory multipoint symmetric secant method for bound constrained optimization
• The primal algorithm using conjugate directions for quadratic programming problems with simple upper bounds

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4211289)