An algorithm for solving linearly constrained optimization problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3523319 (Why is no real title available?)
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- scientific article; zbMATH DE number 3258269 (Why is no real title available?)
- scientific article; zbMATH DE number 3270344 (Why is no real title available?)
- scientific article; zbMATH DE number 3309658 (Why is no real title available?)
- scientific article; zbMATH DE number 3356498 (Why is no real title available?)
- A General Quadratic Programming Algorithm
- A New Algorithm for Unconstrained Optimization
- A Rapidly Convergent Descent Method for Minimization
- A method for the solution of certain non-linear problems in least squares
- A new approach to variable metric algorithms
- A nonlinear programming technique for the optimization of continuous processing systems
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- Computational experience with quadratically convergent minimisation methods
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- Function Minimization Without Evaluating Derivatives--a Review
- Maximization by Quadratic Hill-Climbing
- Parameter Selection for Modified Newton Methods for Function Minimization
- Variable metric methods of minimisation
Cited in
(20)- An affine scaling interior trust-region method combining with line search filter technique for optimization subject to bounds on variables
- A new trust region method for nonsmooth nonconvex optimization
- Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
- A trust region algorithm with conjugate gradient technique for optimization problems
- An approach to the numerical solutions of geometric programs
- THE COMPUTATION OF ECONOMIC EQUILIBRIA: A JOINT MAXIMIZATION APPROACH
- Convergence properties of trust region methods for linear and convex constraints
- Augmented Lagrange algorithm based bi-object strategy for constraint optimization problem
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- A trust-region-based BFGS method with line search technique for symmetric nonlinear equations
- Quasi-Newton trust region algorithm for non-smooth least squares problems
- Nonmonotone trust region method for solving optimization problems
- An efficient search algorithm for road network optimization
- Optimal designs based on exact confidence regions for parameter estimation of a nonlinear regression model
- A novel algorithm for area traffic capacity control with elastic travel demands
- Optimization over convex polyhedra via Hadamard parametrizations
- A modified Newton method for minimization
- A nonmonotone trust region method with new inexact line search for unconstrained optimization
- Adaptive trust-region algorithms for unconstrained optimization
- Some examples of cycling in variable metric methods for constrained minimization
This page was built for publication: An algorithm for solving linearly constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5663666)
