Cover Image

Probalistic-gradient method for solving certain problems convex optimization

Saved in:

Bibliographic Details
Date:	2014
Main Authors:	A. F. Godonoga, B. M. Chumakov
Format:	Article
Language:	English
Published:	2014
Series:	Teoriia optymalnykh rishen
Online Access:	http://jnas.nbuv.gov.ua/article/UJRN-0000475005
Tags:	Add Tag No Tags, Be the first to tag this record!
Journal Title:	Library portal of National Academy of Sciences of Ukraine \| LibNAS

Institution

Library portal of National Academy of Sciences of Ukraine | LibNAS

Similar Items

On method of solving the problem of convex programming
by: E. I. Nenakhov
Published: (2018)

Existence of solutions and solving method of lexicographic problem of convex optimization with the linear criteria functions
by: N. V. Semenova, et al.
Published: (2020)

A new modified conjugate gradient method under the strong Wolfe line search for solving unconstrained optimization problems
by: M. I. Ishak, et al.
Published: (2022)

On two approaches to model and solve the packing problem for convex polytopes
by: Ju. E. Stojan, et al.
Published: (2018)

Solving distribution type problems by generalized gradient descent
by: G. I. Gorbach, et al.
Published: (1968)

Deterministic and stochastic schemes method of projection subgradient
by: A. F. Godonoga, et al.
Published: (2015)

The theory of convex extensions in combinatorial optimization problems
by: S. V. Jakovlev
Published: (2017)

Determination of some properties of starlike and close-to-convex functions according to subordinate conditions with convexity of a certain analytic function
by: H. Şahin, et al.
Published: (2023)

Lexicographic problems of convex optimization: solvability and optimali-ty conditions, cutting plane method
by: N. V. Semenova, et al.
Published: (2021)

Numerical Methods for Solving the Pursuit Optimization Problems
by: Pashko, C.V., et al.
Published: (2025)

Generalized gradients in dynamic optimization, optimal control, and machine learning problems
by: V. I. Norkin
Published: (2020)

Combined methods for solving degenerate unconstrained optimization problems
by: V. Zadachyn, et al.
Published: (2024)

Optimal Control Method for Solving the Cauchy-Neumann Problem for the Poisson Equation
by: H. F. Guliyev, et al.
Published: (2014)

Optimal Control Method for Solving the Cauchy-Neumann Problem for the Poisson Equation
by: Guliyev, H.F., et al.
Published: (2014)

Algorithm Solving the Problem of Optimal Function by Method of Branch and Bound
by: M. V. Leonova
Published: (2013)

Modern stochastic quasi-gradient optimization algorithms
by: V. I. Norkin, et al.
Published: (2024)

Study of stochastic gradient methods for optimization of algorithms of learning artificial neural networks
by: T. A. Samoljuk
Published: (2017)

Generalized convex sets and the problem of shadow
by: Ju. B. Zelinskij, et al.
Published: (2015)

Method of solving the problem of conditional optimization on a combinatorial set of arrangements
by: L. N. Kolechkina, et al.
Published: (2019)

Parametric Optimization of Metallic Rod Constructions with using the Modified Method of Gradient Projection
by: I. D. Peleshko, et al.
Published: (2021)

The approach to solving the problem of optimization of transportation
by: V. V. Litvynov, et al.
Published: (2015)

The approach to solving the problem of optimization of transportation
by: Litvynov, V.V., et al.
Published: (2015)

Optimal packing of convex polytopes using quasi-phi-functions
by: Pankratov, A. V., et al.
Published: (2015)

Optimal packing of convex polytopes using quasi-phi-functions
by: Pankratov, A. V., et al.
Published: (2015)

Optimal packing of convex polytopes using quasi-phi-functions
by: A. V. Pankratov, et al.
Published: (2015)

Cutting plane method for solving the problem in the best sense of the family of convex Lipschitz functions of uniform approximation of continuous display compact-dimensional subspace
by: V. O. Hnatiuk, et al.
Published: (2014)

Solving the Problems of Multicriteriality in Assessing the Enterprise Activity on the Basis of Multicriteria Optimization Methods
by: L. M. Maliarets, et al.
Published: (2017)

Polynomial method of solving unconditional linear fractional problem of combinatorial optimization on arrangements
by: O. A. Emets, et al.
Published: (2017)

Generalized convex envelopes of sets and the problem of shadow
by: Ju. B. Zelinskij
Published: (2015)

The shadow problem for a family of convex sets
by: Yu. B. Zelinskyi
Published: (2015)

Solving Combinatorial Optimization Problems on Quantum Computers
by: Yu. Korolov, et al.
Published: (2020)

Kernel technology to solve discrete optimization problems
by: I. V. Sergienko, et al.
Published: (2017)

Applying dynamic programming method to solving the problem of optimal allocation of funds between projects
by: N. V. Gripinskaja, et al.
Published: (2020)

A problem of packing of homothetic convex polytopes
by: Yu. H. Stoian, et al.
Published: (2017)

Integration of GIS-technologies and methods of solving continuous problems of optimal multiplex-partitioning of sets
by: L. S. Korjashkina, et al.
Published: (2017)

Parallel computing technologies for solving optimization problems of geometric design
by: Ye. Romanova, et al.
Published: (2019)

Layout problems for arc objects in convex domains
by: Pankratov, A., et al.
Published: (2016)

Layout problems for arc objects in convex domains
by: Pankratov, A., et al.
Published: (2016)

Layout problems for arc objects in convex domains
by: A. Pankratov, et al.
Published: (2016)

Recurrent Method for Solving The Assignment Problem
by: O. B. Matsij, et al.
Published: (2014)