Cover Image

On method of solving the problem of convex programming

Saved in:

Bibliographic Details
Date:	2018
Main Author:	E. I. Nenakhov
Format:	Article
Language:	English
Published:	2018
Series:	Teoriia optymalnykh rishen
Online Access:	http://jnas.nbuv.gov.ua/article/UJRN-0001031539
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

Probalistic-gradient method for solving certain problems convex optimization
by: A. F. Godonoga, et al.
Published: (2014)

On two approaches to model and solve the packing problem for convex polytopes
by: Ju. E. Stojan, et al.
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)

Algorithms for solving a separable quadratic programming problem
by: P. I. Stetsiuk, et al.
Published: (2017)

Parallel algorithms for solving the boolean quadratic programming problem
by: V. P. Shylo, et al.
Published: (2015)

Solving contest problems via formal program verification
by: Shilov, N.V., et al.
Published: (2010)

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

Program-algorithmic support for solving the inverse problems heat transfer
by: N. A. Vareniuk
Published: (2017)

Graph-theoretical approach to solving problem of search for radioactive balls
by: G. A. Donets, et al.
Published: (2014)

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)

New approaches to solving discrete programming problems based on lexicographic search
by: S. V. Chupov
Published: (2016)

A parallel algorithm for solving two-stage stochastic programming problem
by: O. P. Lykhovyd
Published: (2019)

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

Dynamical system approach to solving linear programming problems and applications in economic modelling
by: Tverdokhlib, I.P., et al.
Published: (2002)

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)

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

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

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

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)

The ways to solve the problem of zirconium in the program of creating a nuclear fuel cycle in ukraine
by: S. V. Ladokhin
Published: (2018)

Features of the application of the IQLab program for solving the inverse heat conduction problem for chromiumnickel cylindrical thermosondes
by: E. N. Zotov, et al.
Published: (2018)

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

Numerical method to solve the Cauchy problem with prehistory
by: V. A. Prusov, et al.
Published: (2017)

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

Formalized method for solving multicriteria problems
by: A. M. Voronin, et al.
Published: (2022)

An approximate method for solving assignment problem
by: Marko, M.Y., et al.
Published: (2017)

An approximate method for solving assignment problem
by: M. Y. Marko, et al.
Published: (2017)

Classification of sets by the method of convex hulls linear separation
by: M. A. Ivanchuk
Published: (2015)

Convex extensions for the quadratic problems over permutation matrices
by: O. S. Pichugina, et al.
Published: (2016)

Extreme Sequence Criteria for the Problem of the Best in the Sense of the Convex Function of the Approximation of a Fixed Element by a Convex Set
by: U. V. Hudyma, et al.
Published: (2017)

An evolutionary method for solving the traveling salesman problem
by: Oliinyk, A. О., et al.
Published: (2019)

Convex quadratic ED-problems: properties and subgradient algorithms of solution
by: P. I. Stetsiuk, et al.
Published: (2018)

The numerical methods to solve problems of mathematical safe
by: S. L. Kryvyj
Published: (2019)

An evolutionary method for solving the traveling salesman problem
by: A. O. Oliinyk, et al.
Published: (2019)

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

Parametric method of solving problems of mathematical safe on graphs
by: A. L. Gurin, et al.
Published: (2021)

On the efficient method of solving ill-posed problems by adaptive discretization
by: Solodky, S.G., et al.
Published: (2009)

On solving reverse problems of geophysics applying the methods of the theory of dynamic systems
by: I. E. Stepanova, et al.
Published: (2014)