An extension of the Fletcher-Reeves method to linear equality constrained optimization problem
From MaRDI portal
Publication:482439
DOI10.1016/j.amc.2013.04.055zbMath1302.65156OpenAlexW2008961054MaRDI QIDQ482439
Publication date: 30 December 2014
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2013.04.055
global convergencefeasible direction methodFletcher-Reeves methodlinear equality constrained optimization problem
Related Items (3)
A novel projected Fletcher‐Reeves conjugate gradient approach for finite‐time optimal robust controller of linear constraints optimization problem: Application to bipedal walking robots ⋮ Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems ⋮ Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A variant spectral-type FR conjugate gradient method and its global convergence
- Efficient generalized conjugate gradient algorithms. I: Theory
- Global convergence of a modified spectral FR conjugate gradient method
- Test examples for nonlinear programming codes
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Spectral gradient methods for linearly constrained optimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Linearly constrained minimax optimization
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Function minimization by conjugate gradients
- The conjugate gradient method in extremal problems
- A computational comparison of some non-linear programs
- Methods of conjugate gradients for solving linear systems
- A spectral conjugate gradient method for unconstrained optimization
This page was built for publication: An extension of the Fletcher-Reeves method to linear equality constrained optimization problem
