Finding optimal weights for the problem of Fastest Distributed Consensus on networks with different topologies has been an active area of research for a number of years. Here in this work we present an analytical solution for the problem of Fastest Distributed Consensus for a network formed from fusion of two different symmetric star networks or in other words a network consists of two differen...

Methods are developed and analyzed for estimating the distance to a local minimizer of a nonlinear programming problem. One estimate, based on the solution of a constrained convex quadratic program, can be used when strict complementary slackness and the second-order sufficient optimality conditions hold. A second estimate, based on the solution of an unconstrained nonconvex, nonsmooth optimiza...

Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 14 February 2019Accepted: 10 June 2021Published online: 28 October 2021Keywordssemidefinite programs, storage optimality, low rank, complementary slackness, primal recoveryAMS Subject Headings90C06, 90C22, 49M05Publication DataISSN (print): 1052-6234ISSN (online): 1095-71...

We present a penalty-based algorithm that solves the multicommodity flow problem as a sequence of a fmite number of scaling phases. In the 8-scaling phase the algorithm determines an eoptimal solution, that is, one in which complementary slackness conditions are satisfied to within 8. We analyze the performance of the algorithm from both the theoretical and practical perspectives.

Lower-limb exoskeletons can aid restoring mobility in people with movement disorders. Cable-driven offload their actuators away from the human body to reduce weight imposed on user and enable precise control of joints. However, ensuring limb coordination through bidirectional motion joints using cables raise technical challenge preventing occurrence undesired cable slackness or counteracting fo...

We define the primal and dual linear programming problems involving interval numbers as the way of traditional linear programming problems. We discuss the solution concepts of primal and dual linear programming problems involving interval numbers without converting them to classical linear programming problems. By introducing new arithmetic operations between interval numbers, we prove the weak...

We consider the natural generalizations of packing and covering polyhedra in infinite dimensions, and study issues related to duality and integrality of extreme points for these sets. Using appropriate finite truncations we give conditions under which complementary slackness holds for primal/dual pairs of the infinite linear programming problems associated with infinite packing and covering pol...

Here we present an implementation of Primal-Dual Affine scaling method to solve linear optimisation problem on GPU based systems. Strategies to convert the system generated by complementary slackness theorem into a symmetric system are given. A new CUDA friendly technique to solve the resulting symmetric positive definite subsystem is also developed. Various strategies to reduce the memory tran...