[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
Volume 89, Issue 1May 2024
Publisher:
  • Kluwer Academic Publishers
  • 101 Philip Drive Assinippi Park Norwell, MA
  • United States
ISSN:0925-5001
Reflects downloads up to 08 Mar 2025Bibliometrics
Skip Table Of Content Section
research-article
On asymptotic convergence rate of random search
Abstract

This paper presents general theoretical studies on asymptotic convergence rate (ACR) for finite dimensional optimization. Given the continuous problem function and discrete time stochastic optimization process, the ACR is the optimal constant for ...

research-article
A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis
Abstract

We focus on nonconvex and non-smooth block optimization problems, where the smooth coupling part of the objective does not satisfy a global/partial Lipschitz gradient continuity assumption. A general alternating minimization algorithm is proposed ...

research-article
Strict feasibility for the polynomial complementarity problem
Abstract

In the present paper, the strict feasibility of the polynomial complementarity problem (PCP) is investigated. To this end, as a generalization of the concept of S-tensor, a concept of S-tensor tuple is introduced. Some properties of S-tensor ...

research-article
Existence of solutions to Γ-robust counterparts of gap function formulations of uncertain LCPs with ellipsoidal uncertainty sets
Abstract

In this paper, we give some existence theorems of solutions to Γ-robust counterparts of gap function formulations of uncertain linear complementarity problems, in which Γ plays a role in adjusting the robustness of the model against the level of ...

research-article
A surrogate-assisted evolutionary algorithm with clustering-based sampling for high-dimensional expensive blackbox optimization
Abstract

Many practical problems involve the optimization of computationally expensive blackbox functions. The computational cost resulting from expensive function evaluations considerably limits the number of true objective function evaluations allowed in ...

research-article
Discrete approximation for two-stage stochastic variational inequalities
Abstract

In this paper, the discrete approximation of two-stage stochastic variational inequalities has been investigated when the second stage problem has multiple solutions. First, a discrete approximation scheme is given by a series of models with the ...

research-article
Variable sample-size optimistic mirror descent algorithm for stochastic mixed variational inequalities
Abstract

In this paper, we propose a variable sample-size optimistic mirror descent algorithm under the Bregman distance for a class of stochastic mixed variational inequalities. Different from those conventional variable sample-size extragradient ...

research-article
On inexact versions of a quasi-equilibrium problem: a Cournot duopoly perspective
Abstract

This paper has two parts. In the mathematical part, we present two inexact versions of the proximal point method for solving quasi-equilibrium problems (QEP) in Hilbert spaces. Under mild assumptions, we prove that the methods find a solution to ...

research-article
Public Access
Extragradient-type methods with O1/k last-iterate convergence rates for co-hypomonotone inclusions
Abstract

We develop two “Nesterov’s accelerated” variants of the well-known extragradient method to approximate a solution of a co-hypomonotone inclusion constituted by the sum of two operators, where one is Lipschitz continuous and the other is possibly ...

research-article
Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies
Abstract

We address the problem of configuring a power distribution network with reliability and resilience objectives by satisfying the demands of the consumers and saturating each production source as little as possible. We consider power distribution ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.