Quasi-Newton Updates with Bounds
From MaRDI portal
Publication:3787365
DOI10.1137/0724092zbMath0644.65033OpenAlexW2062677144MaRDI QIDQ3787365
Paul H. Calamai, Jorge J. Moré
Publication date: 1987
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0724092
Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10)
Related Items
Decision model and analysis for investment interest expense deduction and allocation, Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies, Algorithms for bound constrained quadratic programming problems, A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines, Fast algorithm for the quadratic knapsack problem, A Newton's method for the continuous quadratic knapsack problem, Minimum variance allocation among constrained intervals, An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds, The geometric properties of a class of nonsymmetric cones, Variable fixing algorithms for the continuous quadratic Knapsack problem, Finding the projection onto the intersection of a closed half-space and a variable box, A survey on the continuous nonlinear resource allocation problem, Local minima for indefinite quadratic knapsack problems, Breakpoint searching algorithms for the continuous quadratic knapsack problem, Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints, IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS, On linear-time algorithms for the continuous quadratic Knapsack problem, Fast algorithm for singly linearly constrained quadratic programs with box-like constraints, A breakpoint search approach for convex resource allocation problems with bounded variables, Simple solution methods for separable mixed linear and quadratic knapsack problem, New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds, On the solution of concave knapsack problems, A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables, ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration, Variable fixing method by weighted average for the continuous quadratic knapsack problem, Practical quasi-Newton methods for solving nonlinear systems, Algorithms for the solution of quadratic knapsack problems, An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem
