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