Publication:3036155
From MaRDI portal
zbMath0524.49002MaRDI QIDQ3036155
Publication date: 1979
generalized gradient methods; decomposition schemes; cut- off methods; methods with dilatation of the space; minimization of non-smooth functions
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
49M37: Numerical methods based on nonlinear programming
49J35: Existence of solutions for minimax problems
49M27: Decomposition methods
90B99: Operations research and management science
26B05: Continuity and differentiation questions
90C52: Methods of reduced gradient type
49-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control
Related Items
A continuous problem of optimal partition with a nondifferentiable functional, Variable fixing algorithms for the continuous quadratic Knapsack problem, An algorithm for linearly constrained convex nondifferentiable minimization problems, Numerical methods of Lyapunov function construction and their application to the absolute stability problem, TSCALE: A new multidimensional scaling procedure based on Tversky's contrast model, Method of centers for minimizing generalized eigenvalues, Orthogonalizing linear operators in convex programming. I, II, Stochastic generalized gradient method for nonconvex nonsmooth stochastic optimization, Main directions in the development of informatics, Modified cutting plane method for minimization of a convex function, Interindustry model of planned technological-structural changes, Mixed method for solving the general convex programming problem, Synthesis of optimal fuzzy estimation algorithms, \(r\)-algorithms and ellipsoids, Optimization method for stability analysis of delayed linear systems, Method of simple-body centroids, Subgradient method with entropic projections for convex nondifferentiable minimization, Nonsmooth-optimization methods in problems of stochastic programming, Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday), Convergence of \(r\)-algorithms, \(\alpha\)-concave functions and measures and their applications, Lipschitz continuity of the \(\varepsilon\)-subdifferential and nonmonotonic methods with averaging of \(\varepsilon\)-subgradients for nonsmooth optimization, Convergence of the empirical mean method in statistics and stochastic programming, Experimental comparison of algorithms for the problem of the maximum set of pairwise incomparable vertices in a digraph, Analysis of algorithms for a class of continuous partition problems, Approximations in proximal bundle methods and decomposition of convex programs, Optimization of computations, Numerical analysis of the orthogonal descent method, Some directions and results of research in mathematical programming and system analysis, Nondifferentiable optimal control problems for matrix differential equations, Nonparametric search optimization method, Algorithms to solve some problems of concave programming with linear constraints, Minimization of the Hausdorff distance between convex polyhedrons, Parameter optimization problems for multilayer optical coatings, The stochastic quasigradient projection method, Toward a theory of extremal problems, Rapidly convergent modification of the method of chebyshev centers, Some problems of optimal allocation of scarce resources on a network graph of interdependent activities, An algorithm of solution of a multiproduct problem of optimal partitioning with constraints, Method of generalized gradient descent, Normal approximation of the distribution of the optimum point in the data processing problem by the method of least moduli, Using the ?-subgradient method to solve the dual and the primal mathematical programming problems, Convex optimization problems with constraints, Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints, Gradient-type method for minimization of nonsmooth penalty functions, Constrained ?-subgradient method for simultaneous solution of the primal and dual problems of convex programming, Numerical minimization methods for convex functionals dependent on probability measures with applications to optimal pollution monitoring, Disnel: An application package for solving discrete and nonlinear optimization problems, Algorithms to construct a mathematical model of preferences using expert judgments, Stochastic quasigradient method for optimizing the parameters of dynamic systems, Conditional ?-subgradient method for simultaneous solution of the primal and the dual convex programming problems
