scientific article; zbMATH DE number 3830713
From MaRDI portal
Publication:3036155
generalized gradient methodsdecomposition schemescut- off methodsmethods with dilatation of the spaceminimization of non-smooth functions
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Continuity and differentiation questions (26B05) Decomposition methods (49M27) Methods of reduced gradient type (90C52) Existence of solutions for minimax problems (49J35) Operations research and management science (90B99) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01)
Cited in
(86)- Stochastic quasigradient method for optimizing the parameters of dynamic systems
- Using the ?-subgradient method to solve the dual and the primal mathematical programming problems
- An algorithm of solution of a multiproduct problem of optimal partitioning with constraints
- Formalizing spatial configuration optimization problems with the use of a special function class
- Unified representation of the classical ellipsoid method
- Constrained ?-subgradient method for simultaneous solution of the primal and dual problems of convex programming
- Normal approximation of the distribution of the optimum point in the data processing problem by the method of least moduli
- Algorithms to construct a mathematical model of preferences using expert judgments
- Numerical minimization methods for convex functionals dependent on probability measures with applications to optimal pollution monitoring
- Computation of maximal turning points to nonlinear equations by nonsmooth optimization
- Variational inequality type formulations of general market equilibrium problems with local information
- Some problems of optimal allocation of scarce resources on a network graph of interdependent activities
- scientific article; zbMATH DE number 7604747 (Why is no real title available?)
- Subgradient algorithms on Riemannian manifolds of lower bounded curvatures
- scientific article; zbMATH DE number 7656028 (Why is no real title available?)
- On the convergence rate of the subgradient method with metric variation and its applications in neural network approximation schemes
- Convex optimization problems with constraints
- 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
- Nondifferentiable optimal control problems for matrix differential equations
- Nonparametric search optimization method
- Method of generalized gradient descent
- Incremental subgradient algorithms with dynamic step sizes for separable convex optimizations
- Solving a two-stage continuous-discrete problem of optimal partition-allocation with a given position of the centers of subsets
- Toward a theory of extremal problems
- Some directions and results of research in mathematical programming and system analysis
- Modified Fejér sequences and applications
- Solution of continuous problems of optimal covering with spheres using optimal set-partition theory
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- Nonsmooth optimization
- Analysis of algorithms for a class of continuous partition problems
- \(r\)-algorithms and ellipsoids
- Gradient-type method for minimization of nonsmooth penalty functions
- A subgradient method based on gradient sampling for solving convex optimization problems
- Subgradient method with entropic projections for convex nondifferentiable minimization
- Stochastic generalized gradient method for nonconvex nonsmooth stochastic optimization
- Method of centers for minimizing generalized eigenvalues
- Method of simple-body centroids
- Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday)
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- Optimization method for stability analysis of delayed linear systems
- Solving a continuous nonlinear problem of optimal set partition with arrangement of subset centers in the case of a convex objective functional
- Refinement of Lagrangian bounds in optimization problems
- Numerical analysis of the orthogonal descent method
- Disnel: An application package for solving discrete and nonlinear optimization problems
- A continuous problem of optimal partition with a nondifferentiable functional
- Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope
- Parameter optimization problems for multilayer optical coatings
- Theory and software implementations of Shor's \(r\)-algorithms
- Modifications of the two-stage transportation problem and their applications
- 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
- OPTIMIZATION METHODS FOR SOLVING SYSTEMS OF HYDRODYNAMICS NONLINEAR EQUATIONS
- On N. Z. Shor's three scientific ideas
- Optimization of computations
- Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints
- Orthogonalizing linear operators in convex programming. I, II
- Exact penalties for decomposable convex optimization problems
- Decomposition approaches for constrained spatial auction market problems
- Mixed method for solving the general convex programming problem
- A unified framework for stochastic optimization
- \(\alpha\)-concave functions and measures and their applications
- Approximations in proximal bundle methods and decomposition of convex programs
- An approach to the solution of nonlinear unconstrained optimization problems
- Interindustry model of planned technological-structural changes
- Using of modified simplex imbeddings method for solving special class of convex non-differentiable optimization problems
- Numerical methods of Lyapunov function construction and their application to the absolute stability problem
- The stochastic quasigradient projection method
- Lipschitz continuity of the \(\varepsilon\)-subdifferential and nonmonotonic methods with averaging of \(\varepsilon\)-subgradients for nonsmooth optimization
- Experimental comparison of algorithms for the problem of the maximum set of pairwise incomparable vertices in a digraph
- TSCALE: A new multidimensional scaling procedure based on Tversky's contrast model
- Modified cutting plane method for minimization of a convex function
- Minimization of the Hausdorff distance between convex polyhedrons
- Conditional ?-subgradient method for simultaneous solution of the primal and the dual convex programming problems
- Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations
- Nonsmooth-optimization methods in problems of stochastic programming
- Alternance form of optimality conditions in the finite-dimensional space
- Rapidly convergent modification of the method of chebyshev centers
- Convergence of \(r\)-algorithms
- Optimization of the Hausdorff distance between sets in Euclidean space
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
- Convergence of the empirical mean method in statistics and stochastic programming
- Synthesis of optimal fuzzy estimation algorithms
- Algorithms to solve some problems of concave programming with linear constraints
- Main directions in the development of informatics
- Models and information technologies for decision support during structural and technological changes
- Optimality conditions in terms of alternance: two approaches
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)
