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 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.

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.

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.

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.

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.

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.

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.

A Fast Algorithm for Training Large Scale Support Vector Machines

The manuscript presents an augmented Lagrangian—fast projected gradient method (ALFPGM) with an improved scheme of working set selection, pWSS, a decomposition based algorithm for training support vector classification machines (SVM). The manuscript describes the ALFPGM algorithm, provides numerical results for training SVM on large data sets, and compares the training times of ALFPGM and Sequential Minimal Minimization algorithms (SMO) from Scikit-learn library. The numerical results demonstrate that ALFPGM with the improved working selection scheme is capable of training SVM with tens of thousands of training examples in a fraction of the training time of some widely adopted SVM tools.

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.

Water flooding optimization with adjoint model under control constraints

The oil recovery enhancement is a major technical issue in the development of oil and gas fields. The smart oil field is an effective way to deal with the issue. It can achieve the maximum profits in the oil production at a minimum cost, and represents the future direction of oil fields. This paper discusses the core of the smart field theory, mainly the real-time optimization method of the injection-production rate of water-oil wells in a complex oil-gas filtration system. Computing speed is considered as the primary prerequisite because this research depends very much on reservoir numerical simulations and each simulation may take several hours or even days. An adjoint gradient method of the maximum theory is chosen for the solution of the optimal control variables. Conven-tional solving method of the maximum principle requires two solutions of time series： the forward reservoir simulation and the backward adjoint gradient calculation. In this paper, the two processes are combined together and a fully implicit reservoir simulator is developed. The matrixes of the adjoint equation are directly obtained from the fully implicit reservoir simulation, which accelera-tes the optimization solution and enhances the efficiency of the solving model. Meanwhile, a gradient projection algorithm combined with the maximum theory is used to constrain the parameters in the oil field development, which make it possible for the method to be applied to the water flooding optimization in a real oil field. The above theory is tested in several reservoir cases and it is shown that a better development effect of the oil field can be achieved.

Exponentially convergent distributed Nash equilibrium seeking for constrained aggregative games

Distributed Nash equilibrium seeking of aggregative games is investigated and a continuous-time algorithm is proposed.The algorithm is designed by virtue of projected gradient play dynamics and aggregation tracking dynamics,and is applicable to games with constrained strategy sets and weight-balanced communication graphs.The key feature of our method is that the proposed projected dynamics achieves exponential convergence,whereas such convergence results are only obtained for non-projected dynamics in existing works on distributed optimization and equilibrium seeking.Numerical examples illustrate the effectiveness of our methods.

A Trust Region Affine Scaling Method for Bound Constrained Optimization

We study a new trust region affine scaling method for general bound constrained optimiza- tion problems. At each iteration, we compute two trial steps. We compute one along some direction obtained by solving an appropriate quadratic model in an ellipsoidal region. This region is defined by an affine scaling technique. It depends on both the distances of current iterate to boundaries and the trust region radius. For convergence and avoiding iterations trapped around nonstationary points, an auxiliary step is defined along some newly defined approximate projected gradient. By choosing the one which achieves more reduction of the quadratic model from the two above steps as the trial step to generate next iterate, we prove that the iterates generated by the new algorithm are not bounded away from stationary points. And also assuming that the second-order sufficient condition holds at some nondegenerate stationary point, we prove the Q-linear convergence of the objective function values. Preliminary numerical experience for problems with bound constraints from the CUTEr collection is also reported.

Alternative Theorems and Sufficient Conditions of Global Convergence for a Class of Feasible Direction Algorithms

In this paper, two alternative theorems which differ from Theorem 10.2.6 in [1] and Theorem 1 in [3] are presented for a class of feasible direction algorithms. On the basis of alternative theorems, furthermore, two sufficient conditions of global convergence of this class of algorithms are obtained.