A Subspace Decomposition Principle for Scaled Gradient Projection Methods: Local Theory

DOI10.1137/0331014zbMATH Open0781.49018OpenAlexW4236993370MaRDI QIDQ4695427

Author name not available (Why is that?)

Publication date: 17 February 1994

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0331014

zbMATH Keywords

constrained minimizationlocal convergence analysisGafni-Bertsekas scaled gradient projection methodNewtonian scaling operators

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37) Programming in abstract spaces (90C48) Methods of reduced gradient type (90C52) Acceleration of convergence in numerical analysis (65B99)

Recommendations

• On the inexact scaled gradient projection method 👍 👎
• Scaling techniques for \(\epsilon\)-subgradient methods 👍 👎
• A Subspace Decomposition Principle for Scaled Gradient Projection Methods: Global Theory 👍 👎
• New convergence results for the scaled gradient projection method 👍 👎
• On the convergence rate of scaled gradient projection method 👍 👎
• A Subspace Study on Conjugate Gradient Algorithms 👍 👎
• Scalable subspace methods for derivative-free nonlinear least-squares optimization 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: A Subspace Decomposition Principle for Scaled Gradient Projection Methods: Local Theory

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