A new regularization of equilibrium problems on Hadamard manifolds: applications to theories of desires

In this paper, we introduce a new proximal algorithm for equilibrium problems on a genuine Hadamard manifold, using a new regularization term. We first extend recent existence results by considering pseudomonotone bifunctions and a weaker sufficient condition than the coercivity assumption. Then, we consider the convergence of this proximal-like algorithm which can be applied to genuinely Hadamard manifolds and not only to specific ones, as in the recent literature. A striking point is that our new regularization term have a clear interpretation in a recent “variational rationality” approach of human behavior. It represents the resistance to change aspects of such human dynamics driven by motivation to change aspects. This allows us to give an application to the theories of desires, showing how an agent must escape to a succession of temporary traps to be able to reach, at the end, his desires.

     

Existence and Convergence Theorems for Global Minimization of Best Proximity Points in Hilbert Spaces

In order to solve global minimization problems involving best proximity points, we introduce general Mann algorithm for nonself nonexpansive mappings and then prove weak and strong convergence of the proposed algorithm under some suitable conditions in real Hilbert spaces. Furthermore, we also provide numerical experiment to illustrate the convergence behavior of our proposed algorithm.

     

Distributed subgradient method for multi‐agent optimization with quantized communication

This paper focuses on a distributed optimization problem associated with a time‐varying multi‐agent network with quantized communication, where each agent has local access to its convex objective function, and cooperatively minimizes a sum of convex objective functions of the agents over the network. Based on subgradient methods, we propose a distributed algorithm to solve this problem under the additional constraint that agents can only communicate quantized information through the network. We consider two kinds of quantizers and analyze the quantization effects on the convergence of the algorithm. Furthermore, we provide explicit error bounds on the convergence rates that highlight the dependence on the quantization levels. Finally, some simulation results on a l₁‐regression problem are presented to demonstrate the performance of the algorithm. Copyright © 2016 John Wiley & Sons, Ltd.     

How Fast Is the Bandit?

Abstract

In this article we investigate the rate of convergence of the so-called two-armed bandit algorithm. The behavior of the algorithm turns out to be highly non standard: no central limit theorem, possible occurrence of two different rates of convergence with positive probability.     

A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization

In this paper, a novel stochastic extra-step quasi-Newton method is developed to solve a class of nonsmooth nonconvex composite optimization problems. We assume that the gradient of the smooth part of the objective function can only be approximated by stochastic oracles. The proposed method combines general stochastic higher order steps derived from an underlying proximal type fixed-point equation with additional stochastic proximal gradient steps to guarantee convergence. Based on suitable bounds on the step sizes, we establish global convergence to stationary points in expectation and an extension of the approach using variance reduction techniques is discussed. Motivated by large-scale and big data applications, we investigate a stochastic coordinate-type quasi-Newton scheme that allows to generate cheap and tractable stochastic higher order directions. Finally, numerical results on large-scale logistic regression and deep learning problems show that our proposed algorithm compares favorably with other state-of-the-art methods.

     

Halpern-type iterative process for solving split common fixed point and monotone variational inclusion problem between Banach spaces

In this paper, we study the split common fixed point and monotone variational inclusion problem in uniformly convex and 2-uniformly smooth Banach spaces. We propose a Halpern-type algorithm with two self-adaptive stepsizes for obtaining solution of the problem and prove strong convergence theorem for the algorithm. Many existing results in literature are derived as corollary to our main result. In addition, we apply our main result to split common minimization problem and fixed point problem and illustrate the efficiency and performance of our algorithm with a numerical example. The main result in this paper extends and generalizes many recent related results in the literature in this direction.

     

The influence of random interactions and decision heuristics on norm evolution in social networks

In this paper we explore the effect that random social interactions have on the emergence and evolution of social norms in a simulated population of agents. In our model agents observe the behaviour of others and update their norms based on these observations. An agent’s norm is influenced by both their own fixed social network plus a second random network that is composed of a subset of the remaining population. Random interactions are based on a weighted selection algorithm that uses an individual’s path distance on the network to determine their chance of meeting a stranger. This means that friends-of-friends are more likely to randomly interact with one another than agents with a higher degree of separation. We then contrast the cases where agents make highest utility based rational decisions about which norm to adopt versus using a Markov Decision process that associates a weight with the best choice. Finally we examine the effect that these random interactions have on the evolution of a more complex social norm as it propagates throughout the population. We discover that increasing the frequency and weighting of random interactions results in higher levels of norm convergence and in a quicker time when agents have the choice between two competing alternatives. This can be attributed to more information passing through the population thereby allowing for quicker convergence. When the norm is allowed to evolve we observe both global consensus formation and group splintering depending on the cognitive agent model used.     

A Neural Network-Based Policy Iteration Algorithm with Global $$H^2$$ -Superlinear Convergence for Stochastic Games on Domains

In this work, we propose a class of numerical schemes for solving semilinear Hamilton–Jacobi–Bellman–Isaacs (HJBI) boundary value problems which arise naturally from exit time problems of diffusion processes with controlled drift. We exploit policy iteration to reduce the semilinear problem into a sequence of linear Dirichlet problems, which are subsequently approximated by a multilayer feedforward neural network ansatz. We establish that the numerical solutions converge globally in the \(H^2\)-norm and further demonstrate that this convergence is superlinear, by interpreting the algorithm as an inexact Newton iteration for the HJBI equation. Moreover, we construct the optimal feedback controls from the numerical value functions and deduce convergence. The numerical schemes and convergence results are then extended to oblique derivative boundary conditions. Numerical experiments on the stochastic Zermelo navigation problem are presented to illustrate the theoretical results and to demonstrate the effectiveness of the method.

     

Two-stage stochastic programming under multivariate risk constraints with an application to humanitarian relief network design

In this study, we consider two classes of multicriteria two-stage stochastic programs in finite probability spaces with multivariate risk constraints. The first-stage problem features multivariate stochastic benchmarking constraints based on a vector-valued random variable representing multiple and possibly conflicting stochastic performance measures associated with the second-stage decisions. In particular, the aim is to ensure that the decision-based random outcome vector of interest is preferable to a specified benchmark with respect to the multivariate polyhedral conditional value-at-risk or a multivariate stochastic order relation. In this case, the classical decomposition methods cannot be used directly due to the complicating multivariate stochastic benchmarking constraints. We propose an exact unified decomposition framework for solving these two classes of optimization problems and show its finite convergence. We apply the proposed approach to a stochastic network design problem in the context of pre-disaster humanitarian logistics and conduct a computational study concerning the threat of hurricanes in the Southeastern part of the United States. The numerical results provide practical insights about our modeling approach and show that the proposed algorithm is computationally scalable.

     

On inertial proximal algorithm for split variational inclusion problems

ABSTRACT

In this paper, a hybrid proximal algorithm with inertial effect is introduced to solve a split variational inclusion problem in real Hilbert spaces. Under mild conditions on the parameters, we establish weak convergence results for the proposed algorithm. Unlike the earlier iterative methods, we do not impose any conditions on the sequence generated by the proposed algorithm. Also, we extend our results to find a common solution of a split variational inclusion problem and a fixed-point problem. Finally, some numerical examples are given to discuss the convergence and superiority of the proposed iterative methods.     

A Projected Subgradient Method for Nondifferentiable Quasiconvex Multiobjective Optimization Problems

In this paper, we propose a projected subgradient method for solving constrained nondifferentiable quasiconvex multiobjective optimization problems. The algorithm is based on the Plastria subdifferential to overcome potential shortcomings known from algorithms based on the classical gradient. Under suitable, yet rather general assumptions, we establish the convergence of the full sequence generated by the algorithm to a Pareto efficient solution of the problem. Numerical results are presented to illustrate our findings.

     

An iterative algorithm for solving split equilibrium problems and split equality variational inclusions for a class of nonexpansive-type maps

ABSTRACT

In this paper, an iterative algorithm that approximates solutions of split equality fixed point problems (SEFPP) for quasi-φ-nonexpansive maps is constructed. Strong convergence of the sequence generated by this algorithm is established in certain real Banach spaces without imposing any compactness-type condition on either the operators or the space considered. We applied our theorem to solve split equality problem, split equality variational inclusion problem and split equality equilibrium problem. Furthermore, some numerical example is given to demonstrate the implementability of our algorithm. Finally, our theorems improve and complement a host of important recent results.     

Split common fixed point problems for demicontractive operators

In this paper, first, we introduce a new iterative algorithm involving demicontractive mappings in Hilbert spaces and, second, we prove some strong convergence theorems of the proposed method with the Armijo-line search to show the existence of a solution of the split common fixed point problem. Finally, we give some numerical examples to illustrate our main results.

     

Limited-memory BFGS with displacement aggregation

A displacement aggregation strategy is proposed for the curvature pairs stored in a limited-memory BFGS (a.k.a. L-BFGS) method such that the resulting (inverse) Hessian approximations are equal to those that would be derived from a full-memory BFGS method. This means that, if a sufficiently large number of pairs are stored, then an optimization algorithm employing the limited-memory method can achieve the same theoretical convergence properties as when full-memory (inverse) Hessian approximations are stored and employed, such as a local superlinear rate of convergence under assumptions that are common for attaining such guarantees. To the best of our knowledge, this is the first work in which a local superlinear convergence rate guarantee is offered by a quasi-Newton scheme that does not either store all curvature pairs throughout the entire run of the optimization algorithm or store an explicit (inverse) Hessian approximation. Numerical results are presented to show that displacement aggregation within an adaptive L-BFGS scheme can lead to better performance than standard L-BFGS.

     

Fast projection onto the ordered weighted ℓ1 norm ball

In this paper,we provide a finitely terminated yet efficient approach to compute the Euclidean projection onto the ordered weighted?₁(OWL1)norm ball.In particular,an efficient semismooth Newton method is proposed for solving the dual of a reformulation of the original projection problem.Global and local quadratic convergence results,as well as the finite termination property,of the algorithm are proved.Numerical comparisons with the two best-known methods demonstrate the efficiency of our method.In addition,we derive the generalized Jacobian of the studied projector which,we believe,is crucial for the future designing of fast second-order nonsmooth methods for solving general OWL1 norm constrained problems.     

A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems

ABSTRACT

In this paper, we consider a class of sparse inverse semidefinite quadratic programming problems, in which a nonconvex alternating direction method of multiplier is investigated. Under mild conditions, we establish convergence results of our algorithm and the corresponding non-ergodic iteration-complexity is also considered under the assumption that the potential function satisfies the famous Kurdyka–?ojasiewicz property. Numerical results show that our algorithm is suitable to solve the given sparse inverse semidefinite quadratic programming problems.     

A derivative-free three-term projection algorithm involving spectral quotient for solving nonlinear monotone equations

ABSTRACT

In this paper, we develop a three-term conjugate gradient method involving spectral quotient, which always satisfies the famous Dai-Liao conjugacy condition and quasi-Newton secant equation, independently of any line search. This new three-term conjugate gradient method can be regarded as a variant of the memoryless Broyden-Fletcher-Goldfarb-Shanno quasi-Newton method with regard to spectral quotient. By combining this method with the projection technique proposed by Solodov and Svaiter in 1998, we establish a derivative-free three-term projection algorithm for dealing with large-scale nonlinear monotone system of equations. We prove the global convergence of the algorithm and obtain the R-linear convergence rate under some mild conditions. Numerical results show that our projection algorithm is effective and robust, and is more competitive with the TTDFP algorithm proposed Liu and Li [A three-term derivative-free projection method for nonlinear monotone system of equations. Calcolo. 2016;53:427–450].     

Improper versus finitely additive distributions as limits of countably additive probabilities

The Bayesian paradigm with proper priors can be extended either to improper distributions or to finitely additive probabilities (FAPs). Improper distributions and diffuse FAPs can be seen as limits of proper distribution sequences for specific convergence modes. In this paper, we compare these two kinds of limits. We show that improper distributions and FAPs represent two distinct features of the limit behavior of a sequence of proper distribution. More specifically, an improper distribution characterizes the behavior of the sequence inside the domain, whereas diffuse FAPs characterizes how the mass concentrates on the boundary of the domain. Therefore, a diffuse FAP cannot be seen as the counterpart of an improper distribution. As an illustration, we consider several approach to define uniform FAP distributions on natural numbers as an equivalent of improper flat prior. We also show that expected logarithmic convergence may depend on the chosen sequence of compact sets.

     

An iterative algorithm for solving split equality fixed point problems for a class of nonexpansive-type mappings in Banach spaces

In this paper, an iterative algorithm that approximates solutions of split equality fixed point problems (SEFPP) for quasi-?-nonexpansive mappings is constructed. Weak convergence of the sequence generated by this algorithm is established in certain real Banach spaces. The theorem proved is applied to solve split equality problem, split equality variational inclusion problem, and split equality equilibrium problem. Finally, some numerical examples are given to demonstrate the convergence of the algorithm. The theorems proved improve and complement a host of important recent results.

     

Linear convergence of gradient projection algorithm for split equality problems

ABSTRACT

In this paper, we consider the varying stepsize gradient projection algorithm (GPA) for solving the split equality problem (SEP) in Hilbert spaces, and study its linear convergence. In particular, we introduce a notion of bounded linear regularity property for the SEP, and use it to establish the linear convergence property for the varying stepsize GPA. We provide some mild sufficient conditions to ensure the bounded linear regularity property, and then conclude the linear convergence rate of the varying stepsize GPA. To the best of our knowledge, this is the first work to study the linear convergence for the SEP.