scientific article; zbMATH DE number 3302906
From MaRDI portal
Publication:5584384
zbMath0189.49703MaRDI QIDQ5584384
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (88)
Learning fixed point patterns by recurrent networks ⋮ Bayesian estimation of the dispersion matrix of a multivariate normal distribution ⋮ Problème inverse du lieu des meilleures approximations linéaires ⋮ Scalable proximal methods for cause-specific hazard modeling with time-varying coefficients ⋮ 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 ⋮ Optimal design of periodic antireflective structures for the Helmholtz equation ⋮ A simple constructive proof of the arithmetic ‐‐ geometric mean inequality and two applications ⋮ 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 ⋮ Low-rank incremental methods for computing dominant singular subspaces ⋮ Über die Schrittweitenwahl bei Abstiegsverfahren zur Minimierung konvexer Funktionen ⋮ Iterative methods for solving fredholm integral equations ⋮ A cutting-plane algorithm with linear and geometric rates of convergence ⋮ Die Schrittweite beim Gradientenprojektionsverfahren für Probleme der optimalen Steuerung ⋮ How good are the proximal point algorithms? ⋮ Über die Realisierung und Konvergenz von Mehrschrittverfahren zur iterativen Lösung nichtlinearer Gleichungen ⋮ Finite element methods for nonlinear shell analysis ⋮ A simple constructive proof of the arithmetic ‐‐ geometric mean inequality and two applications ⋮ Lipschitzian selections in best approximation by continuous functions ⋮ A superlinearly convergent method for minimization problems with linear inequality constraints ⋮ Explicit examples in ergodic optimization ⋮ Isomorphisms of generalized Cayley graphs ⋮ Newton's method for the common eigenvector problem ⋮ Synchronisation and control of proliferation in cycling cell population models with age structure ⋮ Partitioned quasi-Newton methods for nonlinear equality constrained optimization ⋮ The Convergence of an Algorithm for Solving Sparse Nonlinear Systems ⋮ A doubly relaxed minimal-norm Gauss-Newton method for underdetermined nonlinear least-squares problems ⋮ 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 ⋮ A computational approach to the maximum principle ⋮ Numerical treatment of a parabolic boundary-value control problem ⋮ Hermite-Fejer interpolation at the ‘practical’ Chebyshev nodes ⋮ 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 ⋮ A quasi-Newton method can be obtained from a method of conjugate directions ⋮ A More Lenient Stopping Rule for Line Search Algorithms ⋮ Newton's method and boundary value problems ⋮ Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory ⋮ An algorithm of successive minimization in convex programming ⋮ A globalization procedure for solving nonlinear systems of equations ⋮ Newton's method under mild differentiability conditions ⋮ Cubature and the Tchakaloff cone ⋮ Successive overrelaxation method with projection for finite element solutions of nonlinear radiation cooling problems ⋮ Fast finite methods for a system of linear inequalities ⋮ Nonlinear optimal controls ⋮ Characterizations of strictly convex sets by the uniqueness of support points ⋮ Projection method for unconstrained optimization ⋮ A note on the gradient method ⋮ Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems ⋮ 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 ⋮ Pseudorandom lattices for global optimization ⋮ Bemerkungen zum Gradientenverfahren ⋮ A general approach to one-step iterative methods with application to eigenvalue problems ⋮ Algorithms for \(n\)-th root approximation. ⋮ Optimal control of processes governed by partial differential equations part II: Vibrations ⋮ A Markov inequality in several dimensions ⋮ Envelope-constrained filters with uncertain input ⋮ A Stability Analysis for Perturbed Nonlinear Iterative Methods ⋮ Direct search methods: Then and now ⋮ Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework ⋮ On time-minimal distributed control of vibrating systems governed by an abstract wave equation ⋮ Einzelschrittverfahren zur Lösung konvexer und dual‐konvexer Minimierungsprobleme ⋮ Lipschitz condition in minimum norm problems on bounded functions ⋮ Some fixed point theorems for convex contraction mappings and mappings with convex diminishing diameters. II ⋮ The complexity of anl p method for discrete Tchebycheff approximation in exact arithmetic ⋮ A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems ⋮ Real functions, contraction mappings, and P-completeness ⋮ Ein verallgemeinertes adaptives Modell zur Beschreibung von Lern- und Identifikationsprozessen ⋮ On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems ⋮ A modified secant method for unconstrained minimization ⋮ An adaptive conjugate gradient learning algorithm for efficient training of neural networks
This page was built for publication:
