Convergence of algorithms for perturbed optimization problems
type: Item
instance of: scholarly article
title: Convergence of algorithms for perturbed optimization problems
zbMATH Open document ID: 0721.90080
DOI: 10.1007/BF02055200
published in: Annals of Operations Research
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C48
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 49K40
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 4189497
zbMATH Keywords: Infinite-dimensional optimization
zbMATH Keywords: discretization
zbMATH Keywords: perturbation
zbMATH Keywords: gradient projection method
zbMATH Keywords: conditional gradient method
zbMATH Keywords: quasi-Newton methods
author: Ekkehard W. Sachs
MaRDI profile type: MaRDI publication profile
cites work: A Mesh-Independence Principle for Operator Equations and Their Discretizations
cites work: Q3702408
cites work: Rates of Convergence for Conditional Gradient Algorithms Near Singular and Nonsingular Extremals
cites work: Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems
cites work: Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
cites work: Extremal types for certain \(L^ p \)minimization problems and associated large scale nonlinear programs
cites work: Diagonally Modified Conditional Gradient Methods for Input Constrained Optimal Control Problems
cites work: Efficient dynamic programming implementations of Newton's method for unconstrained optimal control problems
cites work: The effect of perturbations on the convergence rates of optimization algorithms
cites work: Sensitivity analysis for nonlinear programming using penalty methods
cites work: The Local Convergence of Broyden-Like Methods on Lipschitzian Problems in Hilbert Spaces
cites work: Q3906009
cites work: Newton-Goldstein convergence rates for convex constrained minimization problems with singular solutions
cites work: Q3696403
cites work: A Quasi-Newton Method for Elliptic Boundary Value Problems
cites work: Quasi-Newton Methods and Unconstrained Optimal Control Problems
cites work: A pointwise quasi-Newton method for unconstrained optimal control problems
cites work: Approximate quasi-Newton methods
cites work: Mesh independence of Newton-like methods for infinite dimensional problems
cites work: Fast Algorithms for Compact Fixed Point Problems with Inexact Function Evaluations
cites work: Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
cites work: Newton's method for singular constrained optimization problems
cites work: Rates of convergence for adaptive Newton methods
cites work: Broyden's method in Hilbert space
Recommended article: Q3404602
Recommended article: Q4469279
Recommended article: The gradient method in infinite-dimensional optimization problems
Recommended article: Convergence analysis of perturbed feasible descent methods
Recommended article: Q3731446
description: scientific article; zbMATH DE number 4189497