scientific article; zbMATH DE number 4197754

zbMATH Open0725.90073MaRDI QIDQ5202847FDOQ5202847

Authors: Yinyu Ye, Chi-Geun Han, Panos M. Pardalos 

Publication date: 1990

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

Recommendations

• scientific article
• scientific article; zbMATH DE number 1526956
• A primal-dual infeasible interior point algorithm for a convex quadratic programming problem with box constraints
• An interior point method for general large-scale quadratic programming problems
• Interior-point solver for large-scale quadratic programming problems with bound constraints

zbMATH Keywords

box constraintsinterior-point algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Large-scale problems in mathematical programming (90C06) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (9)

• Title not available (Why is that?)
• A hybrid algorithm for the solution of a single commodity spatial equilibrium model
• Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization
• Title not available (Why is that?)
• A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
• A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
• Title not available (Why is that?)
• Interior-point solver for large-scale quadratic programming problems with bound constraints
• A new trust-region method for solving systems of equalities and inequalities

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 Q5202847)