scientific article
From MaRDI portal
Publication:3679813
zbMath0565.49026MaRDI QIDQ3679813
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
convergencenonlinear optimizationiterative algorithmsconvex programminggradient methodsdeterministic optimization
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Optimality conditions for minimax problems (49K35) Methods of reduced gradient type (90C52) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02) Numerical methods in optimal control (49Mxx)
Related Items (11)
Stochastic gradient algorithm of the iterative penalty method solving the maximin problem with coupled constraints ⋮ Subgradient methods for two-stage lexicographic optimization with an infinite number of constraints ⋮ Convergence of one class of iterative processes ⋮ Perturbed steepest-descent technique in multiextremal problems ⋮ Exact penalty method with integrated consideration of the constraints ⋮ Necessary and sufficient conditions for convergence of iteration algorithms of nonlinear programming ⋮ Gradient-type method for minimization of nonsmooth penalty functions ⋮ On the global optimization properties of finite-difference local descent algorithms ⋮ Heavy-ball method in nonconvex optimization problems ⋮ Error tolerance of the conditional gradient method ⋮ Stability of Polyak's algorithm in regular nonconvex problems
This page was built for publication:
