scientific article

Publication date: 1979

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

generalized gradient methods decomposition schemes cut- off methods methods with dilatation of the space minimization of non-smooth functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Existence of solutions for minimax problems (49J35) Decomposition methods (49M27) Operations research and management science (90B99) Continuity and differentiation questions (26B05) Methods of reduced gradient type (90C52) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01)

Related Items

Optimization of the Hausdorff distance between sets in Euclidean space, OPTIMIZATION METHODS FOR SOLVING SYSTEMS OF HYDRODYNAMICS NONLINEAR EQUATIONS, ON THE CONVERGENCE RATE OF THE SUBGRADIENT METHOD WITH METRIC VARIATION AND ITS APPLICATIONS IN NEURAL NETWORK APPROXIMATION SCHEMES, Algorithms to solve some problems of concave programming with linear constraints, Using of modified simplex imbeddings method for solving special class of convex non-differentiable optimization problems, Some problems of optimal allocation of scarce resources on a network graph of interdependent activities, Decomposition approaches for constrained spatial auction market problems, Approximations in proximal bundle methods and decomposition of convex programs, Exact penalties for decomposable convex optimization problems, Computational efficiency of the simplex embedding method in convex nondifferentiable optimization, Optimization of computations, Numerical analysis of the orthogonal descent method, \(r\)-algorithms and ellipsoids, Optimization method for stability analysis of delayed linear systems, An algorithm of solution of a multiproduct problem of optimal partitioning with constraints, Method of generalized gradient descent, 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, Method of simple-body centroids, Some directions and results of research in mathematical programming and system analysis, Normal approximation of the distribution of the optimum point in the data processing problem by the method of least moduli, On N. Z. Shor's three scientific ideas, Subgradient method with entropic projections for convex nondifferentiable minimization, Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations, Unified representation of the classical ellipsoid method, Using the ?-subgradient method to solve the dual and the primal mathematical programming problems, Refinement of Lagrangian bounds in optimization problems, Incremental subgradient algorithms with dynamic step sizes for separable convex optimizations, Modifications of the two-stage transportation problem and their applications, Unnamed Item, Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope, Numerical methods of Lyapunov function construction and their application to the absolute stability problem, Convex optimization problems with constraints, Solving a two-stage continuous-discrete problem of optimal partition-allocation with a given position of the centers of subsets, A unified framework for stochastic optimization, Optimality conditions in terms of alternance: two approaches, Variable fixing algorithms for the continuous quadratic Knapsack problem, Nondifferentiable optimal control problems for matrix differential equations, Nonparametric search optimization method, Unnamed Item, Subgradient algorithms on Riemannian manifolds of lower bounded curvatures, Solving a continuous nonlinear problem of optimal set partition with arrangement of subset centers in the case of a convex objective functional, Theory and software implementations of Shor's \(r\)-algorithms, Nonsmooth Optimization, The stochastic quasigradient projection method, Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints, Gradient-type method for minimization of nonsmooth penalty functions, TSCALE: A new multidimensional scaling procedure based on Tversky's contrast model, Minimization of the Hausdorff distance between convex polyhedrons, Alternance Form of Optimality Conditions in the Finite-Dimensional Space, A continuous problem of optimal partition with a nondifferentiable functional, Formalizing spatial configuration optimization problems with the use of a special function class, A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems, Parameter optimization problems for multilayer optical coatings, Variational inequality type formulations of general market equilibrium problems with local information, Modified Fejér sequences and applications, On the properties of the method of minimization for convex functions with relaxation on the distance to extremum, Computation of maximal turning points to nonlinear equations by nonsmooth optimization, Method of centers for minimizing generalized eigenvalues, Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. II: Algorithms for constructing Voronoi diagrams based on the theory of optimal set partitioning, 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, 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, On some approaches to find Nash equilibrium in concave games, Interindustry model of planned technological-structural changes, Mixed method for solving the general convex programming problem, Synthesis of optimal fuzzy estimation algorithms, Models and information technologies for decision support during structural and technological changes, Solution of continuous problems of optimal covering with spheres using optimal set-partition theory, An approach to the solution of nonlinear unconstrained optimization problems, Nonsmooth-optimization methods in problems of stochastic programming, Analysis of algorithms for a class of continuous partition problems, Toward a theory of extremal problems, Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday), Rapidly convergent modification of the method of chebyshev centers, An algorithm for linearly constrained convex nondifferentiable minimization problems