Various distributed optimization methods have been developed for consensus optimization problems in multi-agent networks. Most of these methods only use gradient or subgradient information of the objective functions, which suffer from slow convergence rate. Recently, a distributed Newton method whose appeal stems from the use of second-order information and its fast convergence rate has been de...

In this paper, we propose two accelerated stochastic subgradient methods for stochastic non-strongly convex optimization problems by leveraging a generic local error bound condition. The novelty of the proposed methods lies at smartly leveraging the recent historical solution to tackle the variance in the stochastic subgradient. The key idea of both methods is to iteratively solve the original ...

Abstract In this article, we introduce an inertial-type algorithm that combines the extragradient subgradient method, projection contraction and viscosity method. The proposed method is used for solving quasimonotone variational inequality problems in infinite dimensional real Hilbert spaces such it does not depend on Lipschitz constant of cost operator. Further, prove strong convergence result...

In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinate (DaC) approach. Such approach amounts to solving a DCOP by iterating (1) a divide stage in which agents divide the DCOP into a set of simpler local subproblems and solve them; and (2) a coordinate stage in which agen...

We design a feedback control architecture for longitudinal flight of an aircraft. The multi-level architecture includes the flight control loop to govern the short term dynamics of the aircraft, and the autopilot to control the long term modes. Using H∞ performance and robustness criteria, the problem is cast as a non-convex and non-smooth optimization program. We present a non-convex bundle me...

We consider a direct search approach for solving nonsmooth minimization problems where the objective function is locally Lipschitz continuous and piecewise continuously differentiable on a finite family of polyhedra. A generating set search method is proposed, which is named structured because the structure of the set of nondifferentiability near the current iterate is exploited to define the s...

The aim of the train timetabling problem is to find a conflict free timetable for a set of passenger and freight trains along their routes in an infrastructure network. Several constraints like station capacities and train dependent running and headway times have to be satisfied. In this work we deal with large scale instances of the aperiodic train timetabling problem for the German railway ne...

Let (M,J, θ) be a closed pseudo-Hermintian (2n+1)-manifold. In this paper, we derive the subgradient estimate for positive solutions to a nonlinear subparabolic equation ∂u ∂t = △bu+au log u+bu on M× [0,∞), where a, b are two real constants. M.S.C. 2010: 32V05, 32V20.

The hierarchical edge bundle method clusters the graph edges to better understand and analyze graphs, but its effectiveness relies critically on the quality of the hierarchical organization of its nodes and edges. This paper proposes a novel graph visualization approach that extracts the community structure of a network and organizes it into a more balanced and meaningful hierarchy so that its ...