A numerical scheme is presented to compute the response of a composite material to an applied eld. The scheme is based on an iteration that uses a Fourier transform based projection method to compute the response of a reference material to the applied eld, and a contraction mapping to relate the response of the reference material to the response of the composite material. The scheme also utiliz...

This article considers the two-player composite Nash equilibrium (CNE) problem with a separable non-smooth part, which is known to include the composite saddle-point (CSP) problem as a special case. Due to its two-block structure, this problem can be solved by any algorithm belonging to the block-decomposition hybrid proximal-extragradient (BD-HPE) framework proposed in [13]. The framework cons...

The composite Lq (0 < q < 1) minimization problem over a general polyhedron has received various applications in machine learning, wireless communications, image restoration, signal reconstruction, etc. This paper aims to provide a theoretical study on this problem. Firstly, we show that for any fixed 0 < q < 1, finding the global minimizer of the problem, even its unconstrained counterpart, is...

The main goal of this paper is to develop uniformly optimal first-order methods for large-scale convex programming (CP). By uniform optimality we mean that the first-order methods themselves do not require the input of any problem parameters, but can still achieve the best possible iteration complexity bounds. To this end, we provide a substantial generalization of the accelerated level method ...

For solving the linear system A x = b we introduce some iteration algorithms, where A = (aij) and b = bi a given matrix and a column vector with elements from a Brouwerian lattice, and is a max–min composite operation. 2005 Elsevier Inc. All rights reserved.

In this paper, we establish a composite iteration scheme by the viscosity approximation method for finding a common element of the set of zero points of an accretive operator and the set of solutions of an equilibrium problem in the framework of a Hilbert space. Mathematics Subject Classification: 39B12, 47H06, 47H10

This paper introduces a composite iteration scheme for approximating a zero point of accretive operators in the framework of uniformly smooth Banach spaces and the reflexive Banach space which has a weak continuous duality map, respectively. Our results improve and extend results of Kim, Xu and some others. AMS Mathematics Subject Classification (1991): 54H25, 47H10

We suggest a modification of the descent splitting methods for decomposable composite optimization problems, which maintains the basic convergence properties, but enables one to reduce the computational expenses per iteration and to provide computations in a distributed manner. It consists in making coordinate-wise steps together with a special threshold control.