A nonmonotone coordinate search method for bound constrained optimization

MaRDI QIDQ5151780zbMATH OpenFDO

Authors J. A. Frau, Elvio A. Pilotta

Publication date 22 February 2021

Full work available at URL https://einspem.upm.edu.my/journal/fullpaper/vol14no3/8.%20Johanna%20&%20Elvio.pdf

zbMATH Keywords

bound constrained optimizationglobal convergencenonmonotone line searchnumerical experimentspattern search methods

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• Global optimization by multilevel coordinate search
• A nonmonotone line search method and its convergence for unconstrained optimization
• A derivative-free algorithm for bound constrained optimization
• A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
• Solving bound constrained optimization via a new nonmonotone spectral projected gradient method

Cited in

(5)

• Selective bi-coordinate method for limit non-smooth resource allocation type problems
• A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
• A modified coordinate search method based on axes rotation
• scientific article; zbMATH DE number 3961356 (Why is no real title available?)
• A class of projected-search methods for bound-constrained optimization

This page was built for publication: A nonmonotone coordinate search method for bound constrained optimization

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