An algorithm for solving linearly constrained optimization problems

DOI10.1007/BF01584540zbMath0249.90067OpenAlexW2000058639MaRDI QIDQ5663666

Roger Fletcher

Publication date: 1972

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

Full work available at URL: https://doi.org/10.1007/bf01584540

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Nonmonotone trust region method for solving optimization problems, A new trust region method for nonsmooth nonconvex optimization, Optimal designs based on exact confidence regions for parameter estimation of a nonlinear regression model, A nonmonotone trust region method with new inexact line search for unconstrained optimization, A trust-region-based BFGS method with line search technique for symmetric nonlinear equations, A novel algorithm for area traffic capacity control with elastic travel demands, Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization, Unnamed Item, Convergence properties of trust region methods for linear and convex constraints, An efficient search algorithm for road network optimization, An affine scaling interior trust-region method combining with line search filter technique for optimization subject to bounds on variables, Incorporating nonmonotone strategies into the trust region method for unconstrained optimization, THE COMPUTATION OF ECONOMIC EQUILIBRIA: A JOINT MAXIMIZATION APPROACH, A modified Newton method for minimization, A Trust Region Algorithm with Conjugate Gradient Technique for Optimization Problems, Some examples of cycling in variable metric methods for constrained minimization, Quasi-Newton trust region algorithm for non-smooth least squares problems, Adaptive trust-region algorithms for unconstrained optimization, An approach to the numerical solutions of geometric programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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