A Modified Lagrange Method for Solving Convex Quadratic Optimization Problems

In this paper, a modified version of the Classical Lagrange Multiplier method is developed for convex quadratic optimization problems. The method, which is evolved from the first order derivative test for optimality of the Lagrangian function with respect to the primary variables of the problem, decomposes the solution process into two independent ones, in which the primary variables are solved for independently, and then the secondary variables, which are the Lagrange multipliers, are solved for, afterward. This is an innovation that leads to solving independently two simpler systems of equations involving the primary variables only, on one hand, and the secondary ones on the other. Solutions obtained for small sized problems (as preliminary test of the method) demonstrate that the new method is generally effective in producing the required solutions.

QUADRATIC OPTIMIZATION METHOD AND ITS APPLICATION ON OPTIMIZING MECHANISM PARAMETER

In order that the mechanism designed meets the requirements of kinematics with optimal dynamics behaviors, a quadratic optimization method is proposed based on the different characteristics of kinematic and dynamic optimization. This method includes two steps of optimization, that is, kinematic and dynamic optimization. Meanwhile, it uses the results of the kinematic optimization as the constraint equations of dynamic optimization. This method is used in the parameters optimization of transplanting mechanism with elliptic planetary gears of high-speed rice seedling transplanter with remarkable significance. The parameters spectrum, which meets to the kinematic requirements, is obtained through visualized human-computer interactions in the kinematics optimization, and the optimal parameters are obtained based on improved genetic algorithm in dynamic optimization. In the dynamic optimization, the objective function is chosen as the optimal＇ dynamic behavior and the constraint equations are from the results of the kinematic optimization, This method is suitable for multi-objective optimization when both the kinematic and dynamic performances act as objective functions.

A SUPERLINEARLY CONVERGENT SPLITTING FEASIBLE SEQUENTIAL QUADRATIC OPTIMIZATION METHOD FOR TWO-BLOCK LARGE-SCALE SMOOTH OPTIMIZATION

This paper discusses the two-block large-scale nonconvex optimization problem with general linear constraints.Based on the ideas of splitting and sequential quadratic optimization(SQO),a new feasible descent method for the discussed problem is proposed.First,we consider the problem of quadratic optimal(QO)approximation associated with the current feasible iteration point,and we split the QO into two small-scale QOs which can be solved in parallel.Second,a feasible descent direction for the problem is obtained and a new SQO-type method is proposed,namely,splitting feasible SQO(SF-SQO)method.Moreover,under suitable conditions,we analyse the global convergence,strong convergence and rate of superlinear convergence of the SF-SQO method.Finally,preliminary numerical experiments regarding the economic dispatch of a power system are carried out,and these show that the SF-SQO method is promising.

A SUPERLINEARLY AND QUADRATICALLY CONVERGENT SQP TYPE FEASIBLE METHOD FOR CONSTRAINED OPTIMIZATION

A new SQP type feasible method for inequality constrained optimization is presented,it is a combination of a master algorithm and an auxiliary algorithm which is taken only in finite iterations.The directions of the master algorithm are generated by only one quadratic programming, and its step\|size is always one, the directions of the auxiliary algorithm are new “second\|order” feasible descent. Under suitable assumptions,the algorithm is proved to possess global and strong convergence, superlinear and quadratic convergence.

METHOD BASED ON DUAL-QUADRATIC PROGRAMMING FOR FRAME STRUCTURAL OPTIMIZATION WITH LARGE SCALE

The optimality criteria （OC） method and mathematical programming （MP） were combined to found the sectional optimization model of frame structures. Different methods were adopted to deal with the different constraints. The stress constraints as local constraints were approached by zero-order approximation and transformed into movable sectional lower limits with the full stress criterion. The displacement constraints as global constraints were transformed into explicit expressions with the unit virtual load method. Thus an approximate explicit model for the sectional optimization of frame structures was built with stress and displacement constraints. To improve the resolution efficiency, the dual-quadratic programming was adopted to transform the original optimization model into a dual problem according to the dual theory and solved iteratively in its dual space. A method called approximate scaling step was adopted to reduce computations and smooth the iterative process. Negative constraints were deleted to reduce the size of the optimization model. With MSC/Nastran software as structural solver and MSC/Patran software as developing platform, the sectional optimization software of frame structures was accomplished, considering stress and displacement constraints. The examples show that the efficiency and accuracy are improved.

Numerical Methods for a Class of Quadratic Matrix Equations

Quadratic matrix equations arise in many elds of scienti c computing and engineering applications.In this paper,we consider a class of quadratic matrix equations.Under a certain condition,we rst prove the existence of minimal nonnegative solution for this quadratic matrix equation,and then propose some numerical methods for solving it.Convergence analysis and numerical examples are given to verify the theories and the numerical methods of this paper.

A Deep Learning Approach to Shape Optimization Problems for Flexoelectric Materials Using the Isogeometric Finite Element Method

A new approach for flexoelectricmaterial shape optimization is proposed in this study.In this work,a proxymodel based on artificial neural network(ANN)is used to solve the parameter optimization and shape optimization problems.To improve the fitting ability of the neural network,we use the idea of pre-training to determine the structure of the neural network and combine different optimizers for training.The isogeometric analysis-finite element method(IGA-FEM)is used to discretize the flexural theoretical formulas and obtain samples,which helps ANN to build a proxy model from the model shape to the target value.The effectiveness of the proposed method is verified through two numerical examples of parameter optimization and one numerical example of shape optimization.

A Hybrid Level Set Optimization Design Method of Functionally Graded Cellular Structures Considering Connectivity

With the continuous advancement in topology optimization and additive manufacturing(AM)technology,the capability to fabricate functionally graded materials and intricate cellular structures with spatially varying microstructures has grown significantly.However,a critical challenge is encountered in the design of these structures–the absence of robust interface connections between adjacent microstructures,potentially resulting in diminished efficiency or macroscopic failure.A Hybrid Level Set Method(HLSM)is proposed,specifically designed to enhance connectivity among non-uniform microstructures,contributing to the design of functionally graded cellular structures.The HLSM introduces a pioneering algorithm for effectively blending heterogeneous microstructure interfaces.Initially,an interpolation algorithm is presented to construct transition microstructures seamlessly connected on both sides.Subsequently,the algorithm enables the morphing of non-uniform unit cells to seamlessly adapt to interconnected adjacent microstructures.The method,seamlessly integrated into a multi-scale topology optimization framework using the level set method,exhibits its efficacy through numerical examples,showcasing its prowess in optimizing 2D and 3D functionally graded materials(FGM)and multi-scale topology optimization.In essence,the pressing issue of interface connections in complex structure design is not only addressed but also a robust methodology is introduced,substantiated by numerical evidence,advancing optimization capabilities in the realm of functionally graded materials and cellular structures.

An Efficient Reliability-Based Optimization Method Utilizing High-Dimensional Model Representation and Weight-Point Estimation Method

The objective of reliability-based design optimization(RBDO)is to minimize the optimization objective while satisfying the corresponding reliability requirements.However,the nested loop characteristic reduces the efficiency of RBDO algorithm,which hinders their application to high-dimensional engineering problems.To address these issues,this paper proposes an efficient decoupled RBDO method combining high dimensional model representation(HDMR)and the weight-point estimation method(WPEM).First,we decouple the RBDO model using HDMR and WPEM.Second,Lagrange interpolation is used to approximate a univariate function.Finally,based on the results of the first two steps,the original nested loop reliability optimization model is completely transformed into a deterministic design optimization model that can be solved by a series of mature constrained optimization methods without any additional calculations.Two numerical examples of a planar 10-bar structure and an aviation hydraulic piping system with 28 design variables are analyzed to illustrate the performance and practicability of the proposed method.

Research on Regulation Method of Energy Storage System Based on Multi-Stage Robust Optimization

To address the scheduling problem involving energy storage systems and uncertain energy,we propose a method based on multi-stage robust optimization.This approach aims to regulate the energy storage system by using a multi-stage robust optimal control method,which helps overcome the limitations of traditional methods in terms of time scale.The goal is to effectively utilize the energy storage power station system to address issues caused by unpredictable variations in environmental energy and fluctuating load throughout the day.To achieve this,a mathematical model is constructed to represent uncertain energy sources such as photovoltaic and wind power.The generalized Benders Decomposition method is then employed to solve the multi-stage objective optimization problem.By decomposing the problem into a series of sub-objectives,the system scale is effectively reduced,and the algorithm’s convergence ability is improved.Compared with other algorithms,the multi-stage robust optimization model has better economy and convergence ability and can be used to guide the power dispatching of uncertain energy and energy storage systems.

Optimization of Open-cast Mining Procedure Based on RSR Method

To explore the optimal evaluation mechanism of open-cast mining procedure,this paper takes the actual operation status of Huolinhe No.1 Open-cast Mine as the research basis,and makes a deep analysis of the four representative mining procedures proposed by this mine.A detailed and comprehensive evaluation system is constructed using rank-sum ratio(RSR)method.The system covers 17 key indicators and aims to evaluate the advantages and disadvantages of each scheme in an all-round and multi-angle manner.Through the calculation and analysis by RSR method,the comprehensive evaluation of the four types of mining procedure schemes is carried out,and finally the secondary river improvement project is determined as the optimal mining implementation scheme,and the joint mining scheme of the south and north areas is the alternative strategy.The research results of this paper are objective,clear and definite,can not only reveal the effectiveness and feasibility of RSR method in solving the problem of open-cast mining procedure optimization,but also provide a strong technical support and decision-making basis for the future production development of Huolinhe No.1 Open-cast Mine.Thus,this study is expected to further promote the scientific and refined process of mining operations.

Horizontal-to-vertical spectral ratio inversion method based on multimodal forest optimization algorithm

The exploration of urban underground spaces is of great significance to urban planning,geological disaster prevention,resource exploration and environmental monitoring.However,due to the existing of severe interferences,conventional seismic methods cannot adapt to the complex urban environment well.Since adopting the single-node data acquisition method and taking the seismic ambient noise as the signal,the microtremor horizontal-to-vertical spectral ratio(HVSR)method can effectively avoid the strong interference problems caused by the complex urban environment,which could obtain information such as S-wave velocity and thickness of underground formations by fitting the microtremor HVSR curve.Nevertheless,HVSR curve inversion is a multi-parameter curve fitting process.And conventional inversion methods can easily converge to the local minimum,which will directly affect the reliability of the inversion results.Thus,the authors propose a HVSR inversion method based on the multimodal forest optimization algorithm,which uses the efficient clustering technique and locates the global optimum quickly.Tests on synthetic data show that the inversion results of the proposed method are consistent with the forward model.Both the adaption and stability to the abnormal layer velocity model are demonstrated.The results of the real field data are also verified by the drilling information.

A new primal-dual interior-point algorithm for convex quadratic optimization

In this paper, a new primal-dual interior-point algorithm for convex quadratic optimization （CQO） based on a kernel function is presented. The proposed function has some properties that are easy for checking. These properties enable us to improve the polynomial complexity bound of a large-update interior-point method （IPM） to O（√n log nlog n/e）, which is the currently best known polynomial complexity bound for the algorithm with the large-update method. Numerical tests were conducted to investigate the behavior of the algorithm with different parameters p, q and θ, where p is the growth degree parameter, q is the barrier degree of the kernel function and θ is the barrier update parameter.

AN EFFECTIVE SEQUENTIAL QUADRATIC PROGRAMMING ALGORITHM FOR NONLINEAR OPTIMIZATION PROBLEMS

In this paper, a new globally convergent algorithm for nonlinear optimization problems with equality and inequality constraints is presented. The new algorithm is of SQP type which determines a search direction by solving a quadratic programming subproblem per iteration. Some revisions on the quadratic programming subproblem have been made in such a way that the associated constraint region is nonempty for each point x generated by the algorithm, i.e. , the subproblems always have optimal solutions. The new algorithm has two important properties. The computation of revision parameter for guaranteeing the consistency of quadratic subproblem and the computation of the second order correction step for superlinear convergence use the same inverse of a matrix per iteration, so the computation amount of the new algorithm will not be increased much more than other SQP type algorithms; Another is that the new algorithm can give automatically a feasible point as a starting point for the quadratic subproblems per iteration, this will obivously simplify the computation procedure of the subproblems. Some numerical results are reported.

An Effective Algorithm for Quadratic Optimization with Non-Convex Inhomogeneous Quadratic Constraints

This paper considers the NP (Non-deterministic Polynomial)-hard problem of finding a minimum value of a quadratic program (QP), subject to m non-convex inhomogeneous quadratic constraints. One effective algorithm is proposed to get a feasible solution based on the optimal solution of its semidefinite programming (SDP) relaxation problem.

SEQUENTIAL QUADRATIC PROGRAMMING METHODS FOR OPTIMAL CONTROL PROBLEMS WITH STATE CONSTRAINTS

A kind of direct methods is presented for the solution of optimal control problems with state constraints. These methods are sequential quadratic programming methods. At every iteration a quadratic programming which is obtained by quadratic approximation to Lagrangian function and linear approximations to constraints is solved to get a search direction for a merit function. The merit function is formulated by augmenting the Lagrangian function with a penalty term. A line search is carried out along the search direction to determine a step length such that the merit function is decreased. The methods presented in this paper include continuous sequential quadratic programming methods and discreate sequential quadratic programming methods.

A quadratic programming method for optimal degree reduction of Bézier curves with G^1-continuity

This paper presents a quadratic programming method for optimal multi-degree reduction of B6zier curves with G^1-continuity. The L2 and I2 measures of distances between the two curves are used as the objective functions. The two additional parameters, available from the coincidence of the oriented tangents, are constrained to be positive so as to satisfy the solvability condition. Finally, degree reduction is changed to solve a quadratic problem of two parameters with linear constraints. Applications of degree reduction of Bezier curves with their parameterizations close to arc-length parameterizations are also discussed.

Optimization Model on Quadratic Programming Problem with Fuzzy

In this paper, the authors propose a computational procedure by using fuzzy approach to fred the optimal solution of quadratic programming problems. The authors divide the calculation of the optimal solution into two stages. In the first stage the authors determine the unconstrained minimization and check its feasibility. The second stage, the authors explore the feasible region from initial point to another point until the authors get the optimal point by using Lagrange multiplier. A numerical example is included to support as illustration of the paper.

An Efficient Method for Reliability-based Multidisciplinary Design Optimization

Design for modem engineering system is becoming multidisciplinary and incorporates practical uncertainties; therefore, it is necessary to synthesize reliability analysis and the multidisciplinary design optimization （MDO） techniques for the design of complex engineering system. An advanced first order second moment method-based concurrent subspace optimization approach is proposed based on the comparison and analysis of the existing multidisciplinary optimization techniques and the reliability analysis methods. It is seen through a canard configuration optimization for a three-surface transport that the proposed method is computationally efficient and practical with the least modification to the current deterministic optimization process.

INTEGRATION SHAPE AND SIZING OPTIMIZATION OF COMPOSITE WING STRUCTURE BASED ON RESPONSE SURFACE METHOD

An effective optimization method for the shape/sizing design of composite wing structures is presented with satisfying weight-cutting results. After decoupling, a kind of two-layer cycled optimization strategy suitable for these integrated shape/sizing optimization is obtained. The uniform design method is used to provide sample points, and approximation models for shape design variables. And the results of sizing optimization are construct- ed with the quadratic response surface method （QRSM）. The complex method based on QRSM is used to opti- mize the shape design variables and the criteria method is adopted to optimize the sizing design variables. Compared with the conventional method, the proposed algorithm is more effective and feasible for solving complex composite optimization problems and has good efficiency in weight cutting.