scientific article; zbMATH DE number 3830713
From MaRDI portal
Publication:3036155
cut- off methodsdecomposition schemesgeneralized gradient methodsmethods with dilatation of the spaceminimization of non-smooth functions
Continuity and differentiation questions (26B05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01) Existence of solutions for minimax problems (49J35) Decomposition methods (49M27) Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Operations research and management science (90B99) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)
Cited in
(87)- 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
- 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)
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
- A unified framework for stochastic optimization
- Modified Fejér sequences and applications
- Convergence of r-algorithms
- \(\alpha\)-concave functions and measures and their applications
- Lipschitz continuity of the -subdifferential and nonmonotonic methods with averaging of -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
- Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope
- Nondifferentiable optimal control problems for matrix differential equations
- Nonparametric search optimization method
- Variational inequality type formulations of general market equilibrium problems with local information
- Solving a two-stage continuous-discrete problem of optimal partition-allocation with a given position of the centers of subsets
- Formalizing spatial configuration optimization problems with the use of a special function class
- On the properties of the method of minimization for convex functions with relaxation on the distance to extremum
- On some approaches to find Nash equilibrium in concave games
- 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
- Optimization of the Hausdorff distance between sets in Euclidean space
- Modifications of the two-stage transportation problem and their applications
- A subgradient method based on gradient sampling for solving convex optimization problems
- Computation of maximal turning points to nonlinear equations by nonsmooth optimization
- Using of modified simplex imbeddings method for solving special class of convex non-differentiable optimization problems
- The stochastic quasigradient projection method
- Nonsmooth optimization
- 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
- On N. Z. Shor's three scientific ideas
- 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
- Optimality conditions in terms of alternance: two approaches
- Subgradient algorithms on Riemannian manifolds of lower bounded curvatures
- 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
- scientific article; zbMATH DE number 7604747 (Why is no real title available?)
- Exact penalties for decomposable convex optimization problems
- Alternance form of optimality conditions in the finite-dimensional space
- scientific article; zbMATH DE number 7656028 (Why is no real title available?)
- A continuous problem of optimal partition with a nondifferentiable functional
- Unified representation of the classical ellipsoid method
- Refinement of Lagrangian bounds in optimization problems
- Incremental subgradient algorithms with dynamic step sizes for separable convex optimizations
- Theory and software implementations of Shor's r-algorithms
- Scientific legacy of academician N. Z. Shor
- 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
- Decomposition approaches for constrained spatial auction market problems
- Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- Solving a continuous nonlinear problem of optimal set partition with arrangement of subset centers in the case of a convex objective functional
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 Q3036155)
