17 hasil untuk "Alzalg Baha"
Menampilkan 1–17 · 0,27 detik · RSS
-
Artikel Jurnal
Algebraic and metric structures of the geometric mean cone
The geometric mean cone (GMC) is a higher-order generalization of the second-order cone and the rotated quadratic cone. While these lower-order cones admit well-established Euclidean Jordan algebraic representations, no analogous framework is currently known for GMCs of order three or higher. In…
-
Artikel Jurnal
An ADMM-based heuristic algorithm for optimization problems over nonconvex second-order cone
The nonconvex second-order cone (nonconvex SOC) is a nonconvex extension to the convex second-order cone, in the sense that it consists of any vector divided into two sub-vectors for which the Euclidean norm of the first sub-vector is at least as large as the Euclidean norm of the second…
-
Artikel Jurnal Teks lengkap
Correction: Approximating a Giving Up Smoking Dynamic on Adolescent Nicotine Dependence in Fractional Order
-
Artikel Jurnal Teks lengkap
Approximating a Giving Up Smoking Dynamic on Adolescent Nicotine Dependence in Fractional Order
In this work, we consider giving up smoking dynamic on adolescent nicotine dependence. First, we use the Caputo derivative to develop the model in fractional order. Then we apply two different numerical methods to compute accurate approximate solutions of this new model in fractional order and…
-
Buku
Combinatorial and Algorithmic Mathematics: From Foundation to Optimization
This book provides an insightful and modern treatment of combinatorial and algorithmic mathematics, with an elegant transition from mathematical foundations to optimization. It is designed for mathematics, computer science, and engineering students. The book is crowned with modern optimization…
-
Buku
Semidefinite Programming and Combinatorial Optimization
In modern convex optimization, the class of optimization that is an immediate enlargement of second-order cone optimization is semidefinite optimization. Semidefinite programming (SDP for short) problems, which include linear programming problems and second-order cone programming problems as…
-
Buku
Second-Order Cone Programming
In modern convex optimization, the class of optimization that is an immediate enlargement of linear programming is not quadratic programming, but rather the so-called second-order cone programming. Second-order cone programming (SOCP for short) problems, which include linear programming problems…
-
Buku
Linear Programming
Since its conception in the 1940s in connection with planning activities of the military, linear programming (also called linear optimization) has come into wide use in industry and many other fields. In this book chapter, we introduce linear programming, and the graphical method, and study the…
-
Buku
Elementary Combinatorial Algorithms
In this book chapter, we present elementary algorithms for searching and exploring a graph. Our focus is on the following searching algorithms: The breadth-first search and the depth-first search. Before this, we learn how to represent a graph in a way that we can use such a representation as an…
-
Buku
Array and Numeric Algorithms
In this book chapter, we present and analyze some standard array and numeric algorithms, such as array multiplication algorithms, array searching algorithms, array sorting algorithms, and Newton’s method algorithm for solving linear and nonlinear systems. We also describe and analyze the integer…
-
Buku
Analysis of Algorithms
An algorithm is a finite set of precise instructions that are performed to solve a problem. So, every algorithm is constructed using a finite sequence of statements. The origin of the word algorithm goes back to Muhammad Ibn Musa Al-Khwarizmi (ca. 780–840), whose book on the Indian number system…
-
Buku
Counting
In this book chapter, we present some important counting principles, permutations, and combinations. The first section in this chapter introduces binomial coefficients and identities which will be used throughout the chapter.
-
Buku
Recurrences
In this book chapter, we present some techniques for solving recurrences. There are five efficient methods for solving recurrences: the guess-and-confirm method, the iteration method, the recursion-tree method, the generating functions method, and the master method. In this chapter, we present the…
-
Buku
Analytic and Algebraic Structures
This book chapter introduces basic analytic and algebraic structures in four sections. The first two sections study sequences, summations, and series, which are used extensively in solving recurrences. The last two sections study subspaces, bases, convex sets, convex cones, convex hulls, and…
-
Buku
Set-Theoretic Structures
Much of mathematical discrete structures are written in terms of sets. In this book chapter, we introduce basic concepts of set theory. After introducing mathematical induction as a method for proving mathematical statements, we study set-theoretic structures such as sets, relations, partitions…
-
Buku
Mathematical Logic
The precise definition of “logic” is quite broad and literally, hundreds of logics have been studied by philosophers, mathematicians, and computer scientists. When most people say "logic", they mean either propositional logic or predicate logic. The propositional logic is the classical one, in…