A moving asymptotes algorithm using new local convex approximation methods with explicit solutions

zbMath1302.65148MaRDI QIDQ468265

Allal Guessab, Mostafa Bachar, Thierry Estebenet

Publication date: 6 November 2014

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/ETNA/volumes/2011-2020/vol43/abstract_vol43_pp21-44.html

zbMATH Keywords

nonlinear programminggeometric convergencemethod of moving asymptotesnumerical testmultivariate convex approximationunconstrained nonlinear optimization problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (4)

A globally convergent modified multivariate version of the method of moving asymptotes ⋮ A globally convergent modified version of the method of moving asymptotes ⋮ The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem ⋮ A globally convergent modified version of the method of moving asymptotes

This page was built for publication: A moving asymptotes algorithm using new local convex approximation methods with explicit solutions