scientific article; zbMATH DE number 3302906

Cited in

(88)

Envelope-constrained filters with uncertain input
On time-minimal distributed control of vibrating systems governed by an abstract wave equation
Lipschitz condition in minimum norm problems on bounded functions
Some fixed point theorems for convex contraction mappings and mappings with convex diminishing diameters. II
Problème inverse du lieu des meilleures approximations linéaires
Successive overrelaxation method with projection for finite element solutions applied to the Dirichlet problem of the nonlinear elliptic equation \(\Delta u=bu^ 2\)
Properties of the sequential gradient-restoration algorithm (SGRA). I: Introduction and comparison with related methods
Starlike domains of convergence for Newton's method at singularities
Stepsize analysis for descent methods
On the convergence of an algorithm for discrete L_p approximation
Nonlinear programming with cumulatively bounded variables
A finite step-size procedure for the F-W method
A cutting-plane algorithm with linear and geometric rates of convergence
Finite element methods for nonlinear shell analysis
Partitioned quasi-Newton methods for nonlinear equality constrained optimization
A nonsmooth optimization problem in envelope constrained filtering
Über die Konvergenz des Davidon-Fletcher-Powell-Verfahrens für streng konvexe Minimierungsaufgaben im Hilbertraum
An iterative procedure for the solution of constrained nonlinear equations with application to optimization problems
Accelerating procedures for methods of conjugate directions
Numerical treatment of a parabolic boundary-value control problem
Solution of eigenvalue problems in Hilbert spaces by a gradient method
Convergence of gradient methods for optimal control problems
A convergence theory for a class of anti-jamming strategies
Sufficient conditions for the convergence of monotonic mathematical programming algorithms
Optimization under nonnegativity constraints
An accelerated conjugate direction method to solve linearly constrained minimization problems
On theoretical and numerical aspects of the bang-bang-principle
Des algorithmes pour le problème inverse des valeurs propres
On saddle point problems in the calculus of variations, the Rity algorithm, and monotone convergence
Numerically stable computation of step-sizes for descent methods. The nonconvex case
A second-order method for unconstrained optimization
On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems
An adaptive conjugate gradient learning algorithm for efficient training of neural networks
Learning fixed point patterns by recurrent networks
Direct search methods: Then and now
A globalization procedure for solving nonlinear systems of equations
Successive overrelaxation method with projection for finite element solutions of nonlinear radiation cooling problems
Fast finite methods for a system of linear inequalities
Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems
Pseudorandom lattices for global optimization
A Markov inequality in several dimensions
Scalable proximal methods for cause-specific hazard modeling with time-varying coefficients
Explicit examples in ergodic optimization
Synchronisation and control of proliferation in cycling cell population models with age structure
A doubly relaxed minimal-norm Gauss-Newton method for underdetermined nonlinear least-squares problems
A computational approach to the maximum principle
Newton's method and boundary value problems
Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
Newton's method under mild differentiability conditions
Cubature and the Tchakaloff cone
Nonlinear optimal controls
Projection method for unconstrained optimization
A note on the gradient method
On the observability of non-linear systems with applications to non- linear regression analysis
A constructive proof of the Kuhn-Tucker multiplier rule
On infinite-dimensional convex programs
Bemerkungen zum Gradientenverfahren
A general approach to one-step iterative methods with application to eigenvalue problems
Algorithms for \(n\)-th root approximation.
A simple constructive proof of the arithmetic ‐‐ geometric mean inequality and two applications
The complexity of anl p method for discrete Tchebycheff approximation in exact arithmetic
Bayesian estimation of the dispersion matrix of a multivariate normal distribution
How good are the proximal point algorithms?
Über die Realisierung und Konvergenz von Mehrschrittverfahren zur iterativen Lösung nichtlinearer Gleichungen
A Stability Analysis for Perturbed Nonlinear Iterative Methods
A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems
Low-rank incremental methods for computing dominant singular subspaces
A quasi-Newton method can be obtained from a method of conjugate directions
An algorithm of successive minimization in convex programming
Optimal design of periodic antireflective structures for the Helmholtz equation
Isomorphisms of generalized Cayley graphs
A More Lenient Stopping Rule for Line Search Algorithms
Optimal control of processes governed by partial differential equations part II: Vibrations
Einzelschrittverfahren zur Lösung konvexer und dual‐konvexer Minimierungsprobleme
Ein verallgemeinertes adaptives Modell zur Beschreibung von Lern- und Identifikationsprozessen
A modified secant method for unconstrained minimization
Hermite-Fejer interpolation at the ‘practical’ Chebyshev nodes
Characterizations of strictly convex sets by the uniqueness of support points
The Convergence of an Algorithm for Solving Sparse Nonlinear Systems
Über die Schrittweitenwahl bei Abstiegsverfahren zur Minimierung konvexer Funktionen
Iterative methods for solving fredholm integral equations
Die Schrittweite beim Gradientenprojektionsverfahren für Probleme der optimalen Steuerung
A superlinearly convergent method for minimization problems with linear inequality constraints
A simple constructive proof of the arithmetic ‐‐ geometric mean inequality and two applications
Choose your path wisely: gradient descent in a Bregman distance framework
Real functions, contraction mappings, and P-completeness
Lipschitzian selections in best approximation by continuous functions
Newton's method for the common eigenvector problem

This page was built for publication:

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