A New Conjugate Gradient Projection Method for Solving Stochastic Generalized Linear Complementarity Problems

In this paper, a class of the stochastic generalized linear complementarity problems with finitely many elements is proposed for the first time. Based on the Fischer-Burmeister function, a new conjugate gradient projection method is given for solving the stochastic generalized linear complementarity problems. The global convergence of the conjugate gradient projection method is proved and the related numerical results are also reported.

A Probe Method of Gradient Projection Type

In this paper,a probe method for nonlinear programming wiht equality and inequality is given. Its iterative directions at an arbitrary point x can be obtained through solving a liear system. The terminate conditions and choices of the parameters are given. The global convergence of the method is proved. Further more,some well known gradient projection type algorithms [1-15] and new gradient projection type algorithms from the linear system are given in this paper.

Discontinuous element pressure gradient stabilizations for compressible Navier-Stokes equations based on local projections

A pressure gradient discontinuous finite element formulation for the compressible Navier-Stokes equations is derived based on local projections. The resulting finite element formulation is stable and uniquely solvable without requiring a B-B stability condition. An error estimate is Obtained.

A NOTE ON THE GRADIENT PROJECTION METHOD WITH EXACT STEPSIZE RULE

In this paper, we give some convergence results on the gradient projection method with exact stepsize rule for solving the minimization problem with convex constraints. Especially, we show that if the objective function is convex and its gradient is Lipschitz continuous, then the whole sequence of iterations produced by this method with bounded exact stepsizes converges to a solution of the concerned problem.

ROSEN'S GRADIENT PROJECTION WITH DISCRETE STEPS

In 1960, J. B. Rosen gave a famous Gradient Projection Method in [1]. But the convergenceof the algorithm has not been proved for a Jong time. Many authors paid much attention to thisproblem, such as X.S. Zhang proved in [2] (1984) that the limit point of {x_k} which is generatedby Rosen's algorithm is a K-T piont for a 3-dimensional caes, if {x_k} is convergent. D. Z. Duproved in [3] (1986) that Rosen's algorithm is convergent for 4-dimensional.In [4] (1986), theauthor of this paper gave a general proof of the convergence of Rosen's Gradient Projection Methodfor an n-dimensional case. As Rosen's method requires exact line search, we know that exact linesearch is very difficult on computer.In this paper a line search method of discrete steps are presentedand the convergence of the algorithm is proved.

Reduced projection augmented Lagrange bi-conjugate gradient method for contact and impact problems

Based on the numerical governing formulation and non-linear complementary conditions of contact and impact problems, a reduced projection augmented Lagrange bi- conjugate gradient method is proposed for contact and impact problems by translating non-linear complementary conditions into equivalent formulation of non-linear program- ming. For contact-impact problems, a larger time-step can be adopted arriving at numer- ical convergence compared with penalty method. By establishment of the impact-contact formulations which are equivalent with original non-linear complementary conditions, a reduced projection augmented Lagrange bi-conjugate gradient method is deduced to im- prove precision and efficiency of numerical solutions. A numerical example shows that the algorithm we suggested is valid and exact.

Distributed Nash Equilibrium Seeking Strategies Under Quantized Communication

This paper is concerned with distributed Nash equi librium seeking strategies under quantized communication. In the proposed seeking strategy, a projection operator is synthesized with a gradient search method to achieve the optimization o players' objective functions while restricting their actions within required non-empty, convex and compact domains. In addition, a leader-following consensus protocol, in which quantized informa tion flows are utilized, is employed for information sharing among players. More specifically, logarithmic quantizers and uniform quantizers are investigated under both undirected and connected communication graphs and strongly connected digraphs, respec tively. Through Lyapunov stability analysis, it is shown that play ers' actions can be steered to a neighborhood of the Nash equilib rium with logarithmic and uniform quantizers, and the quanti fied convergence error depends on the parameter of the quan tizer for both undirected and directed cases. A numerical exam ple is given to verify the theoretical results.

Application of a Derivative-Free Method with Projection Skill to Solve an Optimization Problem

Improving numerical forecasting skill in the atmospheric and oceanic sciences by solving optimization problems is an important issue. One such method is to compute the conditional nonlinear optimal perturbation(CNOP), which has been applied widely in predictability studies. In this study, the Differential Evolution(DE) algorithm, which is a derivative-free algorithm and has been applied to obtain CNOPs for exploring the uncertainty of terrestrial ecosystem processes, was employed to obtain the CNOPs for finite-dimensional optimization problems with ball constraint conditions using Burgers' equation. The aim was first to test if the CNOP calculated by the DE algorithm is similar to that computed by traditional optimization algorithms, such as the Spectral Projected Gradient(SPG2) algorithm. The second motive was to supply a possible route through which the CNOP approach can be applied in predictability studies in the atmospheric and oceanic sciences without obtaining a model adjoint system, or for optimization problems with non-differentiable cost functions. A projection skill was first explanted to the DE algorithm to calculate the CNOPs. To validate the algorithm, the SPG2 algorithm was also applied to obtain the CNOPs for the same optimization problems. The results showed that the CNOPs obtained by the DE algorithm were nearly the same as those obtained by the SPG2 algorithm in terms of their spatial distributions and nonlinear evolutions. The implication is that the DE algorithm could be employed to calculate the optimal values of optimization problems, especially for non-differentiable and nonlinear optimization problems associated with the atmospheric and oceanic sciences.

PROJECTED GRADIENT DESCENT BASED ON SOFT THRESHOLDING IN MATRIX COMPLETION

Matrix completion is the extension of compressed sensing.In compressed sensing,we solve the underdetermined equations using sparsity prior of the unknown signals.However,in matrix completion,we solve the underdetermined equations based on sparsity prior in singular values set of the unknown matrix,which also calls low-rank prior of the unknown matrix.This paper firstly introduces basic concept of matrix completion,analyses the matrix suitably used in matrix completion,and shows that such matrix should satisfy two conditions:low rank and incoherence property.Then the paper provides three reconstruction algorithms commonly used in matrix completion:singular value thresholding algorithm,singular value projection,and atomic decomposition for minimum rank approximation,puts forward their shortcoming to know the rank of original matrix.The Projected Gradient Descent based on Soft Thresholding(STPGD),proposed in this paper predicts the rank of unknown matrix using soft thresholding,and iteratives based on projected gradient descent,thus it could estimate the rank of unknown matrix exactly with low computational complexity,this is verified by numerical experiments.We also analyze the convergence and computational complexity of the STPGD algorithm,point out this algorithm is guaranteed to converge,and analyse the number of iterations needed to reach reconstruction error.Compared the computational complexity of the STPGD algorithm to other algorithms,we draw the conclusion that the STPGD algorithm not only reduces the computational complexity,but also improves the precision of the reconstruction solution.

Projected gradient trust-region method for solving nonlinear systems with convex constraints

In this paper, a projected gradient trust region algorithm for solving nonlinear equality systems with convex constraints is considered. The global convergence results are developed in a very general setting of computing trial directions by this method combining with the line search technique. Close to the solution set this method is locally Q-superlinearly convergent under an error bound assumption which is much weaker than the standard nonsingularity condition.

A projected gradient method with nonmonotonic backtracking technique for solving convex constrained monotone variational inequality problem

Based on a differentiable merit function proposed by Taji, et al in “Mathematical Programming, 1993, 58： 369-383”, a projected gradient trust region method for the monotone variational inequality problem with convex constraints is presented. Theoretical analysis is given which proves that the proposed algorithm is globally convergent and has a local quadratic convergence rate under some reasonable conditions. The results of numerical experiments are reported to show the effectiveness of the proposed algorithm.

ANonmonotone Projected Gradient Method for Multiobjective Problems on Convex Sets

In this work we consider an extension of the classical scalar-valued projected gradient method for multiobjective problems on convex sets.As in Fazzio et al.(Optim Lett 13:1365-1379,2019)a parameter which controls the step length is considered and an updating rule based on the spectral gradient method from the scalar case is proposed.In the present paper,we consider an extension of the traditional nonmonotone approach of Grippo et al.(SIAM J Numer Anal 23:707-716,1986)based on the maximum of some previous function values as suggested in Mita et al.(J Glob Optim 75:539-559,2019)for unconstrained multiobjective optimization problems.We prove the accumulation points of sequences generated by the proposed algorithm,if they exist,are stationary points of the original problem.Numerical experiments are reported.

A FAST CONVERGING SPARSE RECONSTRUCTION ALGORITHM IN GHOST IMAGING

A fast converging sparse reconstruction algorithm in ghost imaging is presented. It utilizes total variation regularization and its formulation is based on the Karush-Kuhn-Tucker (KKT) theorem in the theory of convex optimization. Tests using experimental data show that, compared with the algorithm of Gradient Projection for Sparse Reconstruction (GPSR), the proposed algorithm yields better results with less computation work.

A multi-objective model for cordon-based congestion pricing schemes with nonlinear distance tolls

Congestion pricing is an important component of urban intelligent transport system.The efficiency,equity and the environmental impacts associated with road pricing schemes are key issues that should be considered before such schemes are implemented.This paper focuses on the cordon-based pricing with distance tolls,where the tolls are determined by a nonlinear function of a vehicles' travel distance within a cordon,termed as toll charge function.The optimal tolls can give rise to:1) higher total social benefits,2) better levels of equity,and 3) reduced environmental impacts(e.g.,less emission).Firstly,a deterministic equilibrium(DUE) model with elastic demand is presented to evaluate any given toll charge function.The distance tolls are non-additive,thus a modified path-based gradient projection algorithm is developed to solve the DUE model.Then,to quantitatively measure the equity level of each toll charge function,the Gini coefficient is adopted to measure the equity level of the flows in the entire transport network based on equilibrium flows.The total emission level is used to reflect the impacts of distance tolls on the environment.With these two indexes/measurements for the efficiency,equity and environmental issues as well as the DUE model,a multi-objective bi-level programming model is then developed to determine optimal distance tolls.The multi-objective model is converted to a single level model using the goal programming.A genetic algorithm(GA) is adopted to determine solutions.Finally,a numerical example is presented to verify the methodology.

Design and optimization of a semi-active suspension system for railway applications

The present work focused on the application of innovative damping technologies in order to improve railway vehicle performances in terms of dynamic stability and comfort. As a benchmark case-study, the secondary sus- pension stage was selected and different control techniques were investigated, such as skyhook, dynamic compensation, and sliding mode control. The final aim was to investigate which control schemes are suitable for optimal exploitation of the non-linear behavior of the actuators. The performance improvement achieved by adoption of the semi-active dampers on a standard high-speed train was evaluated in terms of passenger comfort. Different control strategies have been investigated by comparing a simple SISO （single input single output） regulator based on the skyhook damper ap- proach with a centralized regulator. The centralized regulator allows for the estimation of a near optimal set of control forces that minimize car-body accelerations with respect to constraints imposed by limited performance of semi-active actuators. Simulation results show that best results is obtained using a mixed approach that considers the simultaneous applications of model based and feedback compensation control terms.

A LEVEL SET METHOD FOR MICROSTRUCTURE DESIGN OF COMPOSITE MATERIALS

Based on a level set model and the homogenization theory, an optimization al- gorithm for ?nding the optimal con?guration of the microstructure with speci?ed properties is proposed, which extends current research on the level set method for structure topology opti- mization. The method proposed employs a level set model to implicitly describe the material interfaces of the microstructure and a Hamilton-Jacobi equation to continuously evolve the ma- terial interfaces until an optimal design is achieved. Meanwhile, the moving velocities of level set are obtained by conducting sensitivity analysis and gradient projection. Besides, how to handle the violated constraints is also discussed in the level set method for topological optimization, and a return-mapping algorithm is constructed. Numerical examples show that the method exhibits outstanding ?exibility of handling topological changes and ?delity of material interface represen- tation as compared with other conventional methods in literatures.

Multiple mobile-obstacle avoidance algorithm for redundant manipulator

In order to overcome the shortcomings of the previous obstacle avoidance algorithms,an obstacle avoidance algorithm applicable to multiple mobile obstacles was proposed.The minimum prediction distance between obstacles and a manipulator was obtained according to the states of obstacles and transformed to escape velocity of the corresponding link of the manipulator.The escape velocity was introduced to the gradient projection method to obtain the joint velocity of the manipulator so as to complete the obstacle avoidance trajectory planning.A7-DOF manipulator was used in the simulation,and the results verified the effectiveness of the algorithm.

A Trip-Chain Based User Equilibrium Traffic Assignment Model with Flexible Activities Scheduling Order

This study developed a user equilibrium traffic assignment model based on trip-chains with flexible activity scheduling order and derived the corresponding optimality conditions. We based on the gradient projection method to develop a solution algorithm, the accuracy of which was verified using the test network of UTown. This model could be used to estimate the transportation demands with and without activities scheduling restriction between OD （origin-destination） pairs based on trip-chains, as well as based on trips. Thus, the proposed model is more generalization than conventional trip based or trip-chain based traffic assignment models.

Minimum distance constrained nonnegative matrix factorization for hyperspectral data unmixing

This paper considers a problem of unsupervised spectral unmixing of hyperspectral data. Based on the Linear Mixing Model （ LMM）, a new method under the framework of nonnegative matrix fac- torization （NMF） is proposed, namely minimum distance constrained nonnegative matrix factoriza- tion （MDC-NMF）. In this paper, firstly, a new regularization term, called endmember distance （ED） is considered, which is defined as the sum of the squared Euclidean distances from each end- member to their geometric center. Compared with the simplex volume, ED has better optimization properties and is conceptually intuitive. Secondly, a projected gradient （PG） scheme is adopted, and by the virtue of ED, in this scheme the optimal step size along the feasible descent direction can be calculated easily at each iteration. Thirdly, a finite step （ no more than the number of endmem- bers） terminated algorithm is used to project a point on the canonical simplex, by which the abun- dance nonnegative constraint and abundance sum-to-one constraint can be accurately satisfied in a light amount of computation. The experimental results, based on a set of synthetic data and real da- ta, demonstrate that, in the same running time, MDC-NMF outperforms several other similar meth- ods proposed recently.

A Framework of Convergence Analysis of Mini-batch Stochastic Projected Gradient Methods

In this paper,we establish a unified framework to study the almost sure global convergence and the expected convergencerates of a class ofmini-batch stochastic(projected)gradient(SG)methods,including two popular types of SG:stepsize diminished SG and batch size increased SG.We also show that the standard variance uniformly bounded assumption,which is frequently used in the literature to investigate the convergence of SG,is actually not required when the gradient of the objective function is Lipschitz continuous.Finally,we show that our framework can also be used for analyzing the convergence of a mini-batch stochastic extragradient method for stochastic variational inequality.