Linearly constrained optimization
type: Item
instance of: scholarly article
title: Linearly constrained optimization
zbMATH Open document ID: 0675.65062
DOI: 10.1007/BF02243146
published in: Computing
publication date: 1989-01-01T00:00:00Z
review text: For linearly constrained optimization problems an algorithm is presented which is based on conjugate gradients. Theoretical considerations are not given. Some numerical tests demonstrate a good behaviour of the algorithm.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 4106162
zbMATH Keywords: linearly constrained optimization
zbMATH Keywords: algorithm
zbMATH Keywords: conjugate gradients
zbMATH Keywords: numerical tests
author: G. M. Ostrovskij
author: M. G. Ostrovskij
author: T. A. Berezhinskij
reviewed by: Johannes Terno
MaRDI profile type: Publication
cites work: An accelerated conjugate direction method to solve linearly constrained minimization problems
cites work: Methods for Modifying Matrix Factorizations
cites work: Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
cites work: Q5652460
cites work: Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming
cites work: A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
cites work: Q4151662
cites work: Q4106692
description: scientific article; zbMATH DE number 4106162