A Two-Segment Approximation Algorithm for Separable Convex Programming with Linear Constraints PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download A Two-Segment Approximation Algorithm for Separable Convex Programming with Linear Constraints PDF full book. Access full book title A Two-Segment Approximation Algorithm for Separable Convex Programming with Linear Constraints by Agha Iqbal Ali. Download full books in PDF and EPUB format.
Author: Agha Iqbal Ali
Publisher:
ISBN:
Category : Convex programming
Languages : en
Pages : 22
Get Book Here
Book Description
Document discusses a new algorithm for the separable convex programming with linear constraints. This is based on the approximation of the objective function by at most two linear pieces in the neighborhood of the current feasible solution. The two segments will be adaptively defined rather than predecided fixed grids. If, furthermore, the objective function is differentiable, and one introduces a non-Archimedean infinitesimal, the algorithm generates a sequence of feasible solutions every cluster point of which is an optimal solution. Computational tests on the problem with up to 196 non-linear variables is presented. (Author).
Author: Agha Iqbal Ali
Publisher:
ISBN:
Category : Convex programming
Languages : en
Pages : 22
Get Book Here
Book Description
Document discusses a new algorithm for the separable convex programming with linear constraints. This is based on the approximation of the objective function by at most two linear pieces in the neighborhood of the current feasible solution. The two segments will be adaptively defined rather than predecided fixed grids. If, furthermore, the objective function is differentiable, and one introduces a non-Archimedean infinitesimal, the algorithm generates a sequence of feasible solutions every cluster point of which is an optimal solution. Computational tests on the problem with up to 196 non-linear variables is presented. (Author).
Author: I. Ali
Publisher:
ISBN:
Category :
Languages : en
Pages : 22
Get Book Here
Book Description
Author:
Publisher:
ISBN:
Category : Aeronautics
Languages : en
Pages : 984
Get Book Here
Book Description
Author: Stephen P. Boyd
Publisher: Cambridge University Press
ISBN: 9780521833783
Category : Business & Economics
Languages : en
Pages : 744
Get Book Here
Book Description
Convex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how such problems can be solved numerically with great efficiency. The book begins with the basic elements of convex sets and functions, and then describes various classes of convex optimization problems. Duality and approximation techniques are then covered, as are statistical estimation techniques. Various geometrical problems are then presented, and there is detailed discussion of unconstrained and constrained minimization problems, and interior-point methods. The focus of the book is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance and economics.
Author: Cheng-Yan Kao
Publisher:
ISBN:
Category : Convex programming
Languages : en
Pages : 344
Get Book Here
Book Description
Author: Ding-zhu Du
Publisher: World Scientific
ISBN: 9814504580
Category :
Languages : en
Pages : 417
Get Book Here
Book Description
In the past few decades, there has been a large amount of work on algorithms for linear network flow problems, special classes of network problems such as assignment problems (linear and quadratic), Steiner tree problem, topology network design and nonconvex cost network flow problems.Network optimization problems find numerous applications in transportation, in communication network design, in production and inventory planning, in facilities location and allocation, and in VLSI design.The purpose of this book is to cover a spectrum of recent developments in network optimization problems, from linear networks to general nonconvex network flow problems./a
Author: James E. FALK
Publisher:
ISBN:
Category :
Languages : en
Pages : 23
Get Book Here
Book Description
Author: James Edward Falk
Publisher:
ISBN:
Category : Convex programming
Languages : en
Pages : 17
Get Book Here
Book Description
Author: Stefan M. Stefanov
Publisher: Springer Nature
ISBN: 3030784010
Category : Mathematics
Languages : en
Pages : 360
Get Book Here
Book Description
In this book, the theory, methods and applications of separable optimization are considered. Some general results are presented, techniques of approximating the separable problem by linear programming problem, and dynamic programming are also studied. Convex separable programs subject to inequality/ equality constraint(s) and bounds on variables are also studied and convergent iterative algorithms of polynomial complexity are proposed. As an application, these algorithms are used in the implementation of stochastic quasigradient methods to some separable stochastic programs. The problems of numerical approximation of tabulated functions and numerical solution of overdetermined systems of linear algebraic equations and some systems of nonlinear equations are solved by separable convex unconstrained minimization problems. Some properties of the Knapsack polytope are also studied. This second edition includes a substantial amount of new and revised content. Three new chapters, 15-17, are included. Chapters 15-16 are devoted to the further analysis of the Knapsack problem. Chapter 17 is focused on the analysis of a nonlinear transportation problem. Three new Appendices (E-G) are also added to this edition and present technical details that help round out the coverage. Optimization problems and methods for solving the problems considered are interesting not only from the viewpoint of optimization theory, optimization methods and their applications, but also from the viewpoint of other fields of science, especially the artificial intelligence and machine learning fields within computer science. This book is intended for the researcher, practitioner, or engineer who is interested in the detailed treatment of separable programming and wants to take advantage of the latest theoretical and algorithmic results. It may also be used as a textbook for a special topics course or as a supplementary textbook for graduate courses on nonlinear and convex optimization.
Author: Chung Jerry Lin
Publisher:
ISBN:
Category : Computer programming
Languages : en
Pages : 378
Get Book Here
Book Description
