The following pages link to (Q3036155):
Displaying 50 items.
- Optimization of the Hausdorff distance between sets in Euclidean space (Q265867) (← links)
- Using of modified simplex imbeddings method for solving special class of convex non-differentiable optimization problems (Q307853) (← links)
- On N. Z. Shor's three scientific ideas (Q380646) (← links)
- Optimality conditions in terms of alternance: two approaches (Q462998) (← links)
- Theory and software implementations of Shor's \(r\)-algorithms (Q681720) (← links)
- 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 (Q747294) (← links)
- Decomposition approaches for constrained spatial auction market problems (Q844131) (← links)
- Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations (Q891710) (← links)
- Variable fixing algorithms for the continuous quadratic Knapsack problem (Q927220) (← links)
- Solving a continuous nonlinear problem of optimal set partition with arrangement of subset centers in the case of a convex objective functional (Q946751) (← links)
- Models and information technologies for decision support during structural and technological changes (Q1040369) (← links)
- Solution of continuous problems of optimal covering with spheres using optimal set-partition theory (Q1040406) (← links)
- An approach to the solution of nonlinear unconstrained optimization problems (Q1040414) (← links)
- An algorithm for linearly constrained convex nondifferentiable minimization problems (Q1058460) (← links)
- Numerical methods of Lyapunov function construction and their application to the absolute stability problem (Q1162976) (← links)
- TSCALE: A new multidimensional scaling procedure based on Tversky's contrast model (Q1205768) (← links)
- Method of centers for minimizing generalized eigenvalues (Q1260783) (← links)
- Orthogonalizing linear operators in convex programming. I, II (Q1280891) (← links)
- Stochastic generalized gradient method for nonconvex nonsmooth stochastic optimization (Q1280941) (← links)
- Main directions in the development of informatics (Q1280975) (← links)
- Modified cutting plane method for minimization of a convex function (Q1280984) (← links)
- Interindustry model of planned technological-structural changes (Q1286300) (← links)
- Mixed method for solving the general convex programming problem (Q1288666) (← links)
- Synthesis of optimal fuzzy estimation algorithms (Q1288673) (← links)
- \(r\)-algorithms and ellipsoids (Q1364116) (← links)
- Optimization method for stability analysis of delayed linear systems (Q1369622) (← links)
- Method of simple-body centroids (Q1375256) (← links)
- Subgradient method with entropic projections for convex nondifferentiable minimization (Q1384058) (← links)
- Nonsmooth-optimization methods in problems of stochastic programming (Q1580189) (← links)
- Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday) (Q1592008) (← links)
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization (Q1644014) (← links)
- A unified framework for stochastic optimization (Q1719609) (← links)
- Modified Fejér sequences and applications (Q1790672) (← links)
- Convergence of \(r\)-algorithms (Q1816009) (← links)
- \(\alpha\)-concave functions and measures and their applications (Q1816039) (← links)
- Lipschitz continuity of the \(\varepsilon\)-subdifferential and nonmonotonic methods with averaging of \(\varepsilon\)-subgradients for nonsmooth optimization (Q1816109) (← links)
- Convergence of the empirical mean method in statistics and stochastic programming (Q1816114) (← links)
- Experimental comparison of algorithms for the problem of the maximum set of pairwise incomparable vertices in a digraph (Q1816346) (← links)
- Analysis of algorithms for a class of continuous partition problems (Q1842452) (← links)
- Approximations in proximal bundle methods and decomposition of convex programs (Q1893328) (← links)
- Optimization of computations (Q1905130) (← links)
- Numerical analysis of the orthogonal descent method (Q1905135) (← links)
- Some directions and results of research in mathematical programming and system analysis (Q1918737) (← links)
- Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope (Q1956969) (← links)
- Nondifferentiable optimal control problems for matrix differential equations (Q1968562) (← links)
- Nonparametric search optimization method (Q1968880) (← links)
- Variational inequality type formulations of general market equilibrium problems with local information (Q2031949) (← links)
- Solving a two-stage continuous-discrete problem of optimal partition-allocation with a given position of the centers of subsets (Q2215263) (← links)
- Formalizing spatial configuration optimization problems with the use of a special function class (Q2281354) (← links)
- On the properties of the method of minimization for convex functions with relaxation on the distance to extremum (Q2287166) (← links)
