A New Hybrid Generalized Proximal Point Algorithm for Variational Inequality Problems

In this paper, we propose a modified Bregman-function-based proximal point algorithm for solving variational inequality problems. The algorithm adopts a similar constructive approximate criterion as the one developed by Solodov and Svaiter (Set Valued Analysis 7 (1999) 323) for solving the classical proximal subproblems. Under some suitable conditions, we can get an approximate solution satisfying the accuracy criterion via a single Newton-type step. We obtain the Fejér monotonicity to solutions of VIP for paramonotone operators. Some preliminary computational results are also reported to illustrate the method.     

Application of the Proximal Point Method to Nonmonotone Equilibrium Problems

We consider a general equilibrium problem defined on a convex set, whose cost bifunction may not be monotone. We show that this problem can be solved by the inexact proximal point method if there exists a solution to the dual problem. An application of this approach to nonlinearly constrained problems is also suggested.     

Proximal Point Algorithms for Quasiconvex Pseudomonotone Equilibrium Problems

Journal of Optimization Theory and Applications - We propose a proximal point method for quasiconvex pseudomonotone equilibrium problems. The subproblems of the method are optimization problems...     

An Accelerated Inexact Proximal Point Algorithm for Convex Minimization

The proximal point algorithm is classical and popular in the community of optimization. In practice, inexact proximal point algorithms which solve the involved proximal subproblems approximately subject to certain inexact criteria are truly implementable. In this paper, we first propose an inexact proximal point algorithm with a new inexact criterion for solving convex minimization, and show its O(1/k) iteration-complexity. Then we show that this inexact proximal point algorithm is eligible for being accelerated by some influential acceleration schemes proposed by Nesterov. Accordingly, an accelerated inexact proximal point algorithm with an iteration-complexity of O(1/k ²) is proposed.     

Strong Convergence of an Inexact Proximal Point Algorithm for Equilibrium Problems in Banach Spaces

We develop an inexact proximal point algorithm for solving equilibrium problems in Banach spaces which consists of two principal steps and admits an interesting geometric interpretation. At a certain iterate, first we solve an inexact regularized equilibrium problem with a flexible error criterion to obtain an axillary point. Using this axillary point and the inexact solution of the previous iterate, we construct two appropriate hyperplanes which separate the current iterate from the solution set of the given problem. Then the next iterate is defined as the Bregman projection of the initial point onto the intersection of two halfspaces obtained from the two constructed hyperplanes containing the solution set of the original problem. Assuming standard hypotheses, we present a convergence analysis for our algorithm, establishing that the generated sequence strongly and globally converges to a solution of the problem which is the closest one to the starting point of the algorithm.     

非光滑凸规划的割平面法及其在组合优化中的应用

本文利用次梯度构造了一种割平面 ,将非光滑凸规划松驰为光滑规划 ,给出了一种非光滑凸规划的割平面法 ,并证明了其收敛性 ,通过在组合优化中的应用说明该算法是有效的 .     

求解凸二次规划问题的不可行内点算法

该文对一般的凸二次规划问题，给出了一个不可行内点算法，并证明了该算法经过犗（狀２犔）步迭代之后，要么得到问题的一个近似最优解，要么说明该问题在某个较大的区域内无解．     

Proximal Point Algorithms for Convex Multi-criteria Optimization with Applications to Supply Chain Risk Management

We study a class of convex multi-criteria optimization problems with convex objective functions under linear constraints. We use a non-scalarization method—namely, two implementable proximal point algorithms—to obtain the Pareto optimum under multi-criteria optimization. We show that the algorithms are globally convergent. We apply the algorithms to a supply chain risk management problem under multi-criteria considerations.     

Inexact Proximal Point Methods for Equilibrium Problems in Banach Spaces

We introduce two inexact proximal-like methods for solving equilibrium problems in reflexive Banach spaces and establish their convergence properties, proving that the sequence generated by each one of them converges to a solution of the equilibrium problem under reasonable assumptions.     

An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems

In this article, we consider the convex min-max problem with infinite constraints. We propose an exchange method to solve the problem by using efficient inactive constraint dropping rules. There is no need to solve the maximization problem over the metric space, as the algorithm has merely to find some points in the metric space such that a certain criterion is satisfied at each iteration. Under some mild assumptions, the proposed algorithm is shown to terminate in a finite number of iterations and to provide an approximate solution to the original problem. Preliminary numerical results with the algorithm are promising. To our knowledge, this article is the first one conceived to apply explicit exchange methods for solving nonlinear semi-infinite convex min-max problems.     

Nonlinear Proximal Decomposition Method for Convex Programming

In this paper, we propose a new decomposition method for solving convex programming problems with separable structure. The proposed method is based on the decomposition method proposed by Chen and Teboulle and the nonlinear proximal point algorithm using the Bregman function. An advantage of the proposed method is that, by a suitable choice of the Bregman function, each subproblem becomes essentially the unconstrained minimization of a finite-valued convex function. Under appropriate assumptions, the method is globally convergent to a solution of the problem.     

停车场规划的分片凸规划-建模、算法及应用

本研究停车场选址问题。本抓住主要矛盾，建立实用停车场选址的分片凸规划模型。设计往复调整、下降迭代相结合的算法。并在常州市交通管理规划应用中取得了良好的效果。     

Novel Hybrid Methods for Pseudomonotone Equilibrium Problems and Common Fixed Point Problems

The purpose of this article is to introduce some hybrid algorithms for finding a common element of the solution sets of pseudomonotone equilibrium problems and the fixed point sets of nonexpansive mappings in real Hilbert spaces. Our algorithms combine Mann’s iterative methods and Armijo line-search with parallel splitting-up and hybrid techniques. The strong convergence of the proposed algorithms are established without the assumption on the Lipschitz-type condition for the bifunctions involved.     

全局收敛的凸规划的原始—对偶不可行内点算法

本对一类凸规划提出了一个原始-对偶不可行内点算法,并证明了算法的全局收敛性。     

均衡问题和不动点问题的粘滞近似方法及其应用

用粘滞近似方法产生了一个新的迭代序列,并证明了该迭代序列强收敛于一个非扩张映射的不动点,同时该不动点也是一个变分不等式和一个均衡问题的共同解.作为应用,另外证明了一个关于非扩张映射和严格伪压缩映射的定理.     

Equilibrium Problems with Applications to Eigenvalue Problems

In this paper, we consider equilibrium problems and introduce the concept of (S)₊ condition for bifunctions. Existence results for equilibrium problems with the (S)₊ condition are derived. As special cases, we obtain several existence results for the generalized nonlinear variational inequality studied by Ding and Tarafdar (Ref. 1) and the generalized variational inequality studied by Cubiotti and Yao (Ref. 2). Finally, applications to a class of eigenvalue problems are given.     

一类框式凸规划的原始-对偶内点算法

本文为框式约束的一类凸规划提出了一个新的内点算法,原始－对偶路径跟踪法,并了政算法的迭代复杂性为多项式时间性。     

Proximal Point Algorithm for Quasi-Convex Minimization Problems in Metric Spaces

In this paper, the proximal point algorithm for quasi-convex minimization problem in nonpositive curvature metric spaces is studied. We prove Δ-convergence of the generated sequence to a critical point (which is defined in the text) of an objective quasi-convex, proper and lower semicontinuous function with at least a minimum point as well as some strong convergence results to a minimum point with some additional conditions. The results extend the recent results of the proximal point algorithm in Hadamard manifolds and CAT(0) spaces.     

竞争市场均衡问题的内点算法

本文应用最优化方法求解经济学中的经典问题-竞争市场均衡问题.本文对Ye的算法(Ye首先提出了解Fisher问题的原始-对偶路径跟踪算法)做了改进,分别给出了步长调整和迭代方向分解后的原始-对偶路径跟踪算法,并对算法做了理论证明和复杂性分析.最后分析了初始点的求法,做了初步的数值计算.计算结果表明算法能在有效时间内求得问题的解.