zbMath0652.49002MaRDI QIDQ3797760
Boris T. Polyak
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Optimization of the Hausdorff distance between sets in Euclidean space,
A method of bi-coordinate variations with tolerances and its convergence,
Gradient-free two-point methods for solving stochastic nonsmooth convex optimization problems with small non-random noises,
Cutting-plane method based on epigraph approximation with discarding the cutting planes,
Interior dual proximal point algorithm for linear programs,
Some developments in general variational inequalities,
A model of overpowering a multilevel defense system by attack,
Steepest descent with momentum for quadratic functions is a version of the conjugate gradient method,
Subgradient methods for two-stage lexicographic optimization with an infinite number of constraints,
Convergence of one class of iterative processes,
Using of modified simplex imbeddings method for solving special class of convex non-differentiable optimization problems,
Minimax linear filtering of random sequences with uncertain covariance function,
Methods for minimax estimation under elementwise covariance uncertainty,
Computational efficiency of the simplex embedding method in convex nondifferentiable optimization,
Probability-theoretical generalization of the second Lyapunov method,
Hydraulic resistance coefficient identification in pipelines,
Descent methods with linesearch in the presence of perturbations,
Error estimates and Lipschitz constants for best approximation in continuous function spaces,
Sequential quadratic programming with step control using the Lagrange function,
Iterative processes: A survey of convergence theory using Lyapunov second method,
A simple characterization of solutions sets of convex programs,
\(r\)-algorithms and ellipsoids,
Stochastic gradient processes: A survey of convergence theory using Lyapunov second method,
Existence of solutions of extremal problems,
Approximate functions in a problem of sets separation,
A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix,
A modification of the method of linearization for solving a mathematical programming problem on a simple set of ``parallelepiped type, Method of simple-body centroids, Regularized method for solving variational inequalities with a monotone operator on a polyhedron, The method of characteristics for Hamilton-Jacobi equations and applications to dynamical optimization, Weak sharp solutions for variational inequalities in Banach spaces, Newton's method and its use in optimization, On N. Z. Shor's three scientific ideas, Generalized Bregman projections in convex feasibility problems, Use of reference points for solving MONLP problems, Entropy model of the investment portfolio, An analytic-numerical method for the construction of the reference law of operation for a class of mechanical controlled systems, Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints, An adaptive partial linearization method for optimization problems on product sets, Optimizing placement of the control points at synthesis of the heating process control, Approximation of solutions with singularities of various types for linear ill-posed problems, Conic positive definiteness and sharp minima of fractional orders in vector optimization problems, Weak sharpness for gap functions in vector variational inequalities, A note on weak sharp minima in multicriteria linear programming, Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's, Schemes of involving dual variables in inverse barrier functions for problems of linear and convex programming, Necessary and sufficient conditions for a minimum of mixed order, Finite convergence of a projected proximal point algorithm for the generalized variational inequalities, Local voting protocol for decentralized load balancing of network with switched topology and noise in measurements, Minimizing the feedback matrix norm in modal control problems, Application of the penalty method to nonstationary approximation of an optimization problem, Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity, Separate reconstruction of solution components with singularities of various types for linear operator equations of the first kind, Level-constrained programming, Note on the spatial quantile of a random vector, The two-step problem of investment portfolio selection from two risk assets via the probability criterion, Optimal control problem regularization for the Markov process with finite number of states and constraints, On the problem of probabilistic optimization of time-limited testing, The method of characteristics in an identification problem, Synthesis of zonal controls for a problem of heating with delay under nonseparated boundary conditions, Stabilization of a nonlinear multivariable discrete-time time-invariant plant with uncertainty on a linear pseudoinverse model, Combined structures-controls optimization of lattice trusses, Global weak sharp minima for convex (semi-)infinite optimization problems, Methods for choosing loaded train and car routes along a railroad network, Computing several eigenpairs of Hermitian problems by conjugate gradient iterations, Multicriteria identification sets method, A projection-filter method for solving nonlinear complementarity problems, Improving Tikhonov regularization with linearly constrained optimization: Application to the inverse epicardial potential solution, Maximization of the Choquet integral over a convex set and its application to resource allocation problems, Directional secant method for nonlinear equations, Convergence of directional methods under mild differentiability and applications, Modified fixed-point equations and related iterative methods for variational inequalities, Nonsmooth nonconvex global optimization in a Banach space with a basis, An algorithm for solving the general variational inclusion involving \(A\)-monotone operators, A double projection algorithm for multi-valued variational inequalities and a unified framework of the method, Weak sharp minima for set-valued vector variational inequalities with an application, A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation, Constructing a switching regression with unknown switching points, A discrete multilevel attack-defense model with nonhomogeneous opponent resources, Designing a transport system for a multinode competitive market with variable demand, One modification of the logarithmic barrier function method in linear and convex programming, Stochastic approximation search algorithms with randomization at the input, A cutting-plane method without inclusions of approximating sets for conditional minimization, Conditional subgradient optimization -- theory and applications, Extremal problems with rare events. II: Method of successive random approximations, Lipschitz continuity of the \(\varepsilon\)-subdifferential and nonmonotonic methods with averaging of \(\varepsilon\)-subgradients for nonsmooth optimization, An orthogonal descent algorithm to find the zero of a convex function, unsolvability test, and rate of convergence, Optimality conditions for an isolated minimum of order two in \(C1\) constrained optimization, A new penalty function algorithm for convex quadratic programming, Stochastic optimization on Bayesian nets, Orthogonalizing linear operators in convex programming. I, II, Stochastic generalized gradient method for nonconvex nonsmooth stochastic optimization, Linear regression with nonstationary variables and constraints on its parameters, Reducing models of general economic equilibrium to optimization problems., A multipoint method of minimization of a convex function, Congruent closure algorithms for finite automata and some applications, On strongly convex sets and strongly convex functions, Nonlinear stochastic programming by Monte-Carlo estimators, On the rate of convergence of two minimax algorithms, A unified description of iterative algorithms for traffic equilibria, One variant of the objective function parameterization method and its implementation, Variable metric primal-dual method for convex optimization problems with changing constraints, Aircraft cruise altitude and speed profile optimization in a real atmosphere, Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints, Sufficient conditions for the linear convergence of an algorithm for finding the metric projection of a point onto a convex compact set, Descent method for nonsmooth variational inequalities, Synthesis of parameters of proportionally-integral and proportionally-integral-differential controllers for stationary linear objects with nonzero initial conditions, Adaptive subgradient methods for mathematical programming problems with quasiconvex functions, Quasi-solution method and global minimization of the residual functional in conditionally well-posed inverse problems, Methods of support cones and simplices in convex programming and their applications to physicochemical systems, Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property, Random-reshuffled SARAH does not need full gradient computations, Heavy-ball method in nonconvex optimization problems, A minimization method with approximation of feasible set and epigraph of objective function, Multi-level defense system models: overcoming by means of attacks with several phase constraints, 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, Generalized target-allocation functions and their evaluation by the branch-and-bound method, Control of effects in the right-hand sides of a large ODE system of a block structure and optimization of sources in unseparated boundary conditions, Penalty Method for Games of Constraints, Controlling the heating of a rod using the current and preceding time feedback, Feedback minimum principle for quasi-optimal processes of terminally-constrained control problems, On a general scheme of constructing iterative methods for searching for a Nash equilibrium in concave games, A Combined Relaxation Method for Nonlinear Variational Inequalities, Exact penalties for decomposable convex optimization problems, Scheduling with divisible jobs and subcontracting option, Sequential threshold control in descent splitting methods for decomposable optimization problems, Study of transients in oil pipelines, 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, Estimation of variable regression parameters as a two-criterion problem, Conditional ?-subgradient method for simultaneous solution of the primal and the dual convex programming problems, The Newton modified barrier method for QP problems, Unnamed Item, Analytical synthesis of an amplitude-constrained controller, Optimization of right-hand sides of nonlocal boundary conditions in a controlled dynamical system, The method of averaged models for discrete-time adaptive systems, Formulation and methodological approaches to the solution of the multicriteria problem of selecting the optimal modes of complex TPP equipment, Two algorithms for estimating test complexity levels, A new resolvent algorithm for solving a class of variational inclusions, A fast variant of the K-method with the universal adjustable scheme of scanning for few view of sight-computed tomography on Tokamaks, Unnamed Item, Neural network approach to forecasting of quasiperiodic financial time series, Minimization methods for functions on simple sets, Synthesis of numerical methods for Pareto set approximation based on a universal procedure, A new view of some fundamental results in optimization, Convex optimization problems with constraints, Accelerated methods for saddle-point problem, Generalized gradients in dynamic optimization, optimal control, and machine learning problems, Unnamed Item, Linear classifier and projection onto a polytope, On the gradient projection method for weakly convex functions on a proximally smooth set, Reconstruction of boundary controls in parabolic systems, Identification of nonlinear objects by fuzzy knowledge bases, Кросс-энтропийная редукции матрицы данных с ограничением информационной емкости матриц-проекторов и их норм, Robust control of information networks, On the problem of spacing of oil wells and control of their production rates, Deterministic equivalents for the problems of stochastic programming with probabilistic criteria, A centering by the monte-carlo method, Unnamed Item, The gradient projection algorithm for a proximally smooth set and a function with Lipschitz continuous gradient, Optimization of the altitude and speed profile of the aircraft cruise with fixed arrival time, Optimization of source locations and parameters for network structure objects, Linear finite penalty method with descent vector adjustment, A cutting method with approximation of a constraint region and an epigraph for solving conditional minimization problems, Parameter estimation and minimization of a function with random errors and geometric constraints, A new class of Lyapunov functions for stability analysis of singular dynamical systems. Elements of \(p\)-regularity theory, Nonsmooth Optimization, Gradient-type method for minimization of nonsmooth penalty functions, Minimization methods for smooth nonconvex functions, Application of penalty methods to non-stationary variational inequalities, Unnamed Item, Asymptotic equivalence of two finite penalty methods of first order, Regularized penalty method for general equilibrium problems in Banach spaces, Differential equations. Transl. from the Russian, Minimization of the Hausdorff distance between convex polyhedrons, Control reconstruction in hyperbolic systems, Approximating sets on a plane with optimal sets of circles, Alternance Form of Optimality Conditions in the Finite-Dimensional Space, Convergence of nonmonotone line search method, Exact and stable least squares solution to the linear programming problem, Equilibrium formulations of relative optimization problems, Fast gradient descent for convex minimization problems with an oracle producing a \(( \delta, L)\)-model of function at the requested point, Iterative gradient descent methods for solving linear equations, Constructive generalization of classical sufficient second-order optimality conditions, Optimization of source parameters in multipoint nonseparated conditions for linear dynamical systems, Parameter optimization problems for multilayer optical coatings, Unnamed Item, \(\varphi\)-algorithm method for control of discrete dynamic systems, On the properties of the method of minimization for convex functions with relaxation on the distance to extremum, Stochastic approximation algorithm with randomization at the input for unsupervised parameters estimation of Gaussian mixture model with sparse parameters, Transient response in matrix discrete-time linear systems, A Coordinate Wise Variational Method with Tolerance Functions, The gradient projection algorithm for smooth sets and functions in nonconvex case, Constructing Mixed Algorithms on the Basis of Some Bundle Method, Numerical study of high-dimensional optimization problems using a modification of Polyak's method, Characterization of solutions of strong-weak convex programming problems, 2-factor Newton method for solving constrained optimization problems with a degenerate Kuhn-Tucker system, Solving convex min-min problems with smoothness and strong convexity in one group of variables and low dimension in the other, Games of constraints for complex systems, LSPIA, (stochastic) gradient descent, and parameter correction, Method of orthogonal descent, Metric unidimensional scaling and global optimization, A Collection of Test Multiextremal Optimal Control Problems, Self-concordance for empirical likelihood, Convergence of continuous analogues of numerical methods for solving degenerate optimization problems and systems of nonlinear equations, A two-stage cutting-plane method for conditional minimizing function, Maximin problem of communication network synthesis, Gradient methods for nonstationary unconstrained optimization problems, Primal-dual method for optimization problems with changing constraints, Sufficient conditions for a minimum of a strongly quasiconvex function on a weakly convex set, Dynamic method of multipliers in terminal control, Regularized penalty method for non-stationary set valued equilibrium problems in Banach spaces