A proximal regularization of the steepest descent method in Riemannian manifold.
A pseudo-Boolean viewpoint on systems of representatives
A PVT-Type Algorithm for Minimizing a Nonsmooth Convex Function
2000 Mathematics Subject Classification: 90C25, 68W10, 49M37.A general framework of the (parallel variable transformation) PVT-type algorithm, called the PVT-MYR algorithm, for minimizing a non-smooth convex function is proposed, via the Moreau-Yosida regularization. As a particular scheme of this framework an ε-scheme is also presented. The global convergence of this algorithm is given under the assumptions of strong convexity of the objective function and an ε-descent condition determined by an...
A Quadratic Approximation Method for Minimizing a Class of Quasidifferentiable Functions.
A quadratic programming algorithm for large and sparse problems
A Quantitative Model for Evaluating the Impact of a Polluting Stack
A Quasi-Polynomial Algorithm for the Knapsack Problem
A queueing model for error control of partial buffer sharing in ATM.
A queueing network application to a telecommunications distributed system
A queueing problem in pattern recognition
A Queueing Problem with Arrival and Service in Batches of Variable Size.
A queueing system with a fixed accumulation level, random server capacity and capacity dependent service time.
A random search algorithm for finding minimum
A Real Case Study on Transportation Scenario Comparison
A Recession Notion for a Class of Monotone Bivariate Functions
Using monotone bifunctions, we introduce a recession concept for general equilibrium problems relying on a variational convergence notion. The interesting purpose is to extend some results of P. L. Lions on variational problems. In the process we generalize some results by H. Brezis and H. Attouch relative to the convergence of the resolvents associated with maximal monotone operators.
A recovered gradient method applied to smooth optimal shape problems
A new postprocessing technique suitable for nonuniform triangulations is employed in the sensitivity analysis of some model optimal shape design problems.
A RED modified weighted moving average for soft real-time application
The popularity of TCP/IP has resulted in an increase in usage of best-effort networks for real-time communication. Much effort has been spent to ensure quality of service for soft real-time traffic over IP networks. The Internet Engineering Task Force has proposed some architecture components, such as Active Queue Management (AQM). The paper investigates the influence of the weighted moving average on packet waiting time reduction for an AQM mechanism: the RED algorithm. The proposed method for...
A reduced load approximation accounting for link interactions in a loss network.
A refinement of the concept of equilibrium in multiple objective continous games.
A regularization method for ill-posed bilevel optimization problems
We present a regularization method to approach a solution of the pessimistic formulation of ill-posed bilevel problems. This allows to overcome the difficulty arising from the non uniqueness of the lower level problems solutions and responses. We prove existence of approximated solutions, give convergence result using Hoffman-like assumptions. We end with objective value error estimates.