An extension of the Fletcher-Reeves method to linear equality constrained optimization problem

DOI10.1016/J.AMC.2013.04.055MaRDI QIDQ482439zbMATH OpenOpenAlexFDO

Authors Can Li, Dong-Hui Li

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

zbMATH Keywords

feasible direction methodFletcher-Reeves methodglobal convergencelinear equality constrained optimization problem

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 4176369
• An extension of the simplex method to constrained nonlinear optimization
• Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems
• A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
• scientific article; zbMATH DE number 4016607
• scientific article; zbMATH DE number 4081314
• A penalty-free method for equality constrained optimization
• scientific article; zbMATH DE number 3936945
• Some optimization reformulations of the extended linear complementarity problem
• Methods for finding global optimal solutions to linear programs with equilibrium constraints

Cites work

• A computational comparison of some non-linear programs
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A spectral conjugate gradient method for unconstrained optimization
• A survey of nonlinear conjugate gradient methods
• A variant spectral-type FR conjugate gradient method and its global convergence
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Efficient generalized conjugate gradient algorithms. I: Theory
• Function minimization by conjugate gradients
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
• Global convergence of a modified spectral FR conjugate gradient method
• scientific article; zbMATH DE number 3526471 (Why is no real title available?)
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 3278849 (Why is no real title available?)
• Linearly constrained minimax optimization
• Methods of conjugate gradients for solving linear systems
• Spectral gradient methods for linearly constrained optimization
• Test examples for nonlinear programming codes
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• The conjugate gradient method in extremal problems

Cited in

(5)

• 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
• A novel projected fletcher-reeves conjugate gradient approach for finite-time optimal robust controller of linear constraints optimization problem: application to bipedal walking robots
• AN EXTENSION OF LEITMANN'S DIRECT METHOD TO INEQUALITY CONSTRAINTS
• Improvement of FPPR method to solve ECDLP

This page was built for publication: An extension of the Fletcher-Reeves method to linear equality constrained optimization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482439)