A moving asymptotes algorithm using new local convex approximation methods with explicit solutions
zbMATH Open1302.65148MaRDI QIDQ468265FDOQ468265
Authors: Mostafa Bachar, Thierry Estebenet, Allal Guessab 
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- A globally convergent modified version of the method of moving asymptotes
- The method of moving asymptotes—a new method for structural optimization
- A globally convergent modified version of the method of moving asymptotes
- A new algorithm for moving asymptotes for solving unconstrained optimization problems
- scientific article; zbMATH DE number 1859290
nonlinear programmingnumerical testgeometric convergencemethod of moving asymptotesmultivariate convex approximationunconstrained nonlinear optimization problems
Cited In (8)
- A globally convergent modified version of the method of moving asymptotes
- A globally convergent modified version of the method of moving asymptotes
- A globally convergent modified multivariate version of the method of moving asymptotes
- Title not available (Why is that?)
- A moving balls approximation method for a class of smooth constrained minimization problems
- The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem
- A new algorithm for moving asymptotes for solving unconstrained optimization problems
- A new method of moving asymptotes for large-scale linearly equality-constrained minimization
This page was built for publication: A moving asymptotes algorithm using new local convex approximation methods with explicit solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q468265)
