A decomposition algorithm for unconstrained optimization problems with partial derivative information

DOI10.1007/s11590-010-0270-2zbMath1258.90068OpenAlexW1981679729MaRDI QIDQ691378

A. Risi, Giampaolo Liuzzi

Publication date: 30 November 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-010-0270-2

zbMATH Keywords

unconstrained optimizationblock decomposition methodderivative-free iteration

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparing problem formulations for coupled sets of components
• Optimization. Algorithms and consistent approximations
• Penalty Methods for the Solution of Generalized Nash Equilibrium Problems
• On the Convergence of Pattern Search Algorithms
• Introduction to Derivative-Free Optimization
• Globally convergent block-coordinate techniques for unconstrained optimization
• Numerical Optimization
• On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization

This page was built for publication: A decomposition algorithm for unconstrained optimization problems with partial derivative information