An algorithm for solving linearly constrained optimization problems

DOI10.1007/BF01584540zbMath0249.90067MaRDI QIDQ5663666

Roger Fletcher

Publication date: 1972

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

90C30: Nonlinear programming

Related Items

An approach to the numerical solutions of geometric programs, Convergence properties of trust region methods for linear and convex constraints, An efficient search algorithm for road network optimization, A modified Newton method for minimization, Quasi-Newton trust region algorithm for non-smooth least squares problems, Nonmonotone trust region method for solving optimization problems, Incorporating nonmonotone strategies into the trust region method for unconstrained optimization, Optimal designs based on exact confidence regions for parameter estimation of a nonlinear regression model, THE COMPUTATION OF ECONOMIC EQUILIBRIA: A JOINT MAXIMIZATION APPROACH, Some examples of cycling in variable metric methods for constrained minimization

Cites Work

• A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems
• An Algorithm for Least-Squares Estimation of Nonlinear Parameters
• A Rapidly Convergent Descent Method for Minimization
• Function Minimization Without Evaluating Derivatives--a Review
• Maximization by Quadratic Hill-Climbing
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
• Computational experience with quadratically convergent minimisation methods
• Variable metric methods of minimisation
• A new approach to variable metric algorithms
• A General Quadratic Programming Algorithm
• A New Algorithm for Unconstrained Optimization
• Parameter Selection for Modified Newton Methods for Function Minimization
• A method for the solution of certain non-linear problems in least squares
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item