Convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems

The convergence analysis of a nonlinear Lagrange algorithm for solving nonlinear constrained optimization problems with both inequality and equality constraints is explored in detail. The estimates for the derivatives of the multiplier mapping and the solution mapping of the proposed algorithm are discussed via the technique of the singular value decomposition of matrix. Based on the estimates, the local convergence results and the rate of convergence of the algorithm are presented when the penalty parameter is less than a threshold under a set of suitable conditions on problem functions. Furthermore, the condition number of the Hessian of the nonlinear Lagrange function with respect to the decision variables is analyzed, which is closely related to efficiency of the algorithm. Finally, the preliminary numericM results for several typical test problems are reported.

A new evolutionary algorithm for constrained optimization problems

To solve single-objective constrained optimization problems,a new population-based evolutionary algorithm with elite strategy(PEAES) is proposed with the concept of single and multi-objective optimization.Constrained functions are combined to be an objective function.During the evolutionary process,the current optimal solution is found and treated as the reference point to divide the population into three sub-populations:one feasible and two infeasible ones.Different evolutionary operations of single or multi-objective optimization are respectively performed in each sub-population with elite strategy.Thirteen famous benchmark functions are selected to evaluate the performance of PEAES in comparison of other three optimization methods.The results show the proposed method is valid in efficiency,precision and probability for solving single-objective constrained optimization problems.

AN SQP ALGORITHM WITH NONMONOTONE LINE SEARCHFOR GENERAL NONLINEAR CONSTRAINED OPTIMIZATION PROBLEM

In this paper, an SQP type algorithm with a new nonmonotone line search technique for general constrained optimization problems is presented. The new algorithm does not have to solve the second order correction subproblems for each iterations, but still can circumvent the so-called Maratos effect. The algorithm's global convergence and superlinear convergent rate have been proved. In addition, we can prove that, after a few iterations, correction subproblems need not be solved, so computation amount of the algorithm will be decreased much more. Numerical experiments show that the new algorithm is effective.

A New Strategy for Solving a Class of Constrained Nonlinear Optimization Problems Related to Weather and Climate Predictability

There are three common types of predictability problems in weather and climate, which each involve different constrained nonlinear optimization problems： the lower bound of maximum predictable time, the upper bound of maximum prediction error, and the lower bound of maximum allowable initial error and parameter error. Highly effcient algorithms have been developed to solve the second optimization problem. And this optimization problem can be used in realistic models for weather and climate to study the upper bound of the maximum prediction error. Although a filtering strategy has been adopted to solve the other two problems, direct solutions are very time-consuming even for a very simple model, which therefore limits the applicability of these two predictability problems in realistic models. In this paper, a new strategy is designed to solve these problems, involving the use of the existing highly effcient algorithms for the second predictability problem in particular. Furthermore, a series of comparisons between the older filtering strategy and the new method are performed. It is demonstrated that the new strategy not only outputs the same results as the old one, but is also more computationally effcient. This would suggest that it is possible to study the predictability problems associated with these two nonlinear optimization problems in realistic forecast models of weather or climate.

A ROBUST SUPERLINEARLY CONVERGENT ALGORITHM FOR LINEARLY CONSTRAINED OPTIMIZATION PROBLEMS UNDER DEGENERACY

In this paper, the problem of minimizing a convex function subject to general linear constraints is considered. An algorithm which is an extension of the method described in [4] is presented. And a new dual simplex procedure with lexicographic scheme is proposed to deal with the degenerative case in the sense that the gradients of active constraints at the iteration point are dependent. Unlike other methods, the new algorithm possesses the following important property that, at any iteration point generated by the algorithm, one can choose a set of the most suitable basis and from it one can drop all constraints which can be relaxed, not only one constraint once. This property will be helpful in decreasing the computation amount of the algorithm. The global convergence and superlinear convergence of this algorithm are proved,without any assumption of linear independence of the gradients of active constraints.

Algorithm Studies on How to Obtain a Conditional Nonlinear Optimal Perturbation (CNOP)

The conditional nonlinear optimal perturbation （CNOP）, which is a nonlinear generalization of the linear singular vector （LSV）, is applied in important problems of atmospheric and oceanic sciences, including ENSO predictability, targeted observations, and ensemble forecast. In this study, we investigate the computational cost of obtaining the CNOP by several methods. Differences and similarities, in terms of the computational error and cost in obtaining the CNOP, are compared among the sequential quadratic programming （SQP） algorithm, the limited memory Broyden-Fletcher-Goldfarb-Shanno （L-BFGS） algorithm, and the spectral projected gradients （SPG2） algorithm. A theoretical grassland ecosystem model and the classical Lorenz model are used as examples. Numerical results demonstrate that the computational error is acceptable with all three algorithms. The computational cost to obtain the CNOP is reduced by using the SQP algorithm. The experimental results also reveal that the L-BFGS algorithm is the most effective algorithm among the three optimization algorithms for obtaining the CNOP. The numerical results suggest a new approach and algorithm for obtaining the CNOP for a large-scale optimization problem.

A Robust Video Watermarking Scheme with Squirrel Search Algorithm

Advancement in multimedia technology has resulted in protection against distortion,modification,and piracy.For implementing such protection,we have an existing technique called watermarking but obtaining desired distortion level with sufficient robustness is a challenging task for watermarking in multimedia applications.In the paper,we proposed a smart technique for video watermarking associating meta-heuristic algorithms along with an embedding method to gain an optimized efficiency.The main aim of the optimization algorithm is to obtain solutions with maximum robustness,and which should not exceed the set threshold of quality.To represent the accuracy of the proposed scheme,we employ a popular video watermarking technique(DCT domain)having frame selection and embedding method for watermarking.A squirrel search algorithm is chosen as a meta-heuristic algorithm that utilizes the stated fitness function.The results indicate that quality constraint is fulfilled,and the proposed technique gives improved robustness against different attacks with several quality thresholds.The proposed technique could be practically implemented in several multimedia applications such as the films industry,medical imagery,OOT platforms,etc.

Multi-mesh Adaptive Finite Element Algorithms for Constrained Optimal Control Problems Governed By Semi-Linear Parabolic Equations

In this paper, we derive a posteriori error estimators for the constrained optimal control problems governed by semi-linear parabolic equations under some assumptions. Then we use them to construct reliable and efficient multi-mesh adaptive finite element algorithms for the optimal control problems. Some numerical experiments are presented to illustrate the theoretical results.

Superconvergence of Rectangular Mixed Finite Element Methods for Constrained Optimal Control Problem

We investigate the superconvergence properties of the constrained quadratic elliptic optimal control problem which is solved by using rectangular mixed finite element methods.We use the lowest order Raviart-Thomas mixed finite element spaces to approximate the state and co-state variables and use piecewise constant functions to approximate the control variable.We obtain the superconvergence of O(h^(1+s))(0<s≤1)for the control variable.Finally,we present two numerical examples to confirm our superconvergence results.

VARIATIONAL DISCRETIZATION FOR OPTIMAL CONTROL GOVERNED BY CONVECTION DOMINATED DIFFUSION EQUATIONS

In this paper, we study variational discretization for the constrained optimal control problem governed by convection dominated diffusion equations, where the state equation is approximated by the edge stabilization Galerkin method. A priori error estimates are derived for the state, the adjoint state and the control. Moreover, residual type a posteriori error estimates in the L^2-norm are obtained. Finally, two numerical experiments are presented to illustrate the theoretical results.