A Combined Homotopy Infeasible Interior-Point Method for Convex Nonlinear Programming

In this paper, on the basis of the logarithmic barrier function and KKT conditions, we propose a combined homotopy infeasible interior-point method （CHIIP） for convex nonlinear programming problems. For any convex nonlinear programming, without strict convexity for the logarithmic barrier function, we get different solutions of the convex programming in different cases by CHIIP method.

Dynamic economic dispatch combining network flow and interior point method

Under the environment of electric power market, economic dispatch (ED) problem should consider network constraints, unit ramp rates, besides the basic constraints. For this problem, it is important to establish the effective model and algorithm. This paper examines the decoupled conditions that affect the solution optimality to this problem. It proposes an effective model and solution method. Based on the look-ahead technique, it finds the number of time intervals to guarantee the solution optimality. Next, an efficient technique for finding the optimal solution via the interior point methods is described. Test cases, which include dispatching six units over 5 time intervals on the IEEE 30 test system with line flows and ramp constraints are presented. Results indicate that the computational effort as measured by iteration counts or execution time varies only modestly with the problem size.

A New Infeasible Interior-point Method for Linear Complementarity Problem Based on Full Newton Step

This paper proposes an infeasible interior-point algorithm with full-Newton step for linear complementarity problem,which is an extension of Roos about linear optimization. The main iteration of the algorithm consists of a feasibility step and several centrality steps. At last,we prove that the algorithm has O(nlog n/ε) polynomial complexity,which coincides with the best known one for the infeasible interior-point algorithm at present.

Solving Fixed Point Problems in More General Nonconvex Sets Via an Interior Point Homotopy Method

In this paper,we are mainly devoted to solving fixed point problems in more general nonconvex sets via an interior point homotopy method.Under suitable conditions,a constructive proof is given to prove the existence of fixed points,which can lead to an implementable globally convergent algorithm.

A Space-Time Interior Penalty Discontinuous Galerkin Method for the Wave Equation

A new higher-order accurate space-time discontinuous Galerkin(DG)method using the interior penalty flux and discontinuous basis functions,both in space and in time,is pre-sented and fully analyzed for the second-order scalar wave equation.Special attention is given to the definition of the numerical fluxes since they are crucial for the stability and accuracy of the space-time DG method.The theoretical analysis shows that the DG discre-tization is stable and converges in a DG-norm on general unstructured and locally refined meshes,including local refinement in time.The space-time interior penalty DG discre-tization does not have a CFL-type restriction for stability.Optimal order of accuracy is obtained in the DG-norm if the mesh size h and the time stepΔt satisfy h≅CΔt,with C a positive constant.The optimal order of accuracy of the space-time DG discretization in the DG-norm is confirmed by calculations on several model problems.These calculations also show that for pth-order tensor product basis functions the convergence rate in the L∞and L2-norms is order p+1 for polynomial orders p=1 and p=3 and order p for polynomial order p=2.

Globally Convergent Interior Point Methods for Variational Inequalities in Unbounded Sets

The finite-dimensional variational inequality problem (VIP) has been studied extensively in the literature because of its successful applications in many fields such as economics, transportation, regional science and operations research. Barker and Pang[1] have given an excellent survey of theories, methods and applications of VIPs.

Reconstruction method of differentiated backprojection-projection onto convex sets in the interior problem and design of bone-nail model

This work focuses on the application of the reconstruction method of differentiated backprojection （DBP）-projection onto convex sets （POCS） in the interior problem.First,we present the definition of the interior problem and real truncated Hilbert transform,and then outline the implementation steps of DBP-POCS.After that,we introduce the middle-part known condition for region of interest （ROI） accurate reconstruction and the unique condition of the interior problem,and verify the uniqueness and stability of the interior problem accurate reconstruction through numerical experiments,and then compare the results for the interior problem in reconstruction images using filtered backprojection （FBP）.In addition,the authors also design the application models of ROI reconstruction and make an initial attempt to the application of DBP-POCS method in the interior problem.

A NEW FRAMEWORK OF PRIMAL-DUAL INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR PROGRAMMING

On the basis of the formulations of the logarithmic barrier function and the idea of following the path of minimizers for the logarithmic barrier family of problems the so called "centralpath" for linear programming, we propose a new framework of primal-dual infeasible interiorpoint method for linear programming problems. Without the strict convexity of the logarithmic barrier function, we get the following results: (a) if the homotopy parameterμcan not reach to zero,then the feasible set of these programming problems is empty; (b) if the strictly feasible set is nonempty and the solution set is bounded, then for any initial point x, we can obtain a solution of the problems by this method; (c) if the strictly feasible set is nonempty and the solution set is unbounded, then for any initial point x, we can obtain a (?)-solution; and(d) if the strictly feasible set is nonempty and the solution set is empty, then we can get the curve x(μ), which towards to the generalized solutions.

An Effective Method for Solving the Induced Surface Current for Arbitrary Conducting Bodies at the Interior Resonance

The incorrect surface current may be obtained in the vicinity of the resonant frequencies when the method of moments is used to solve either the electric or magnetic field surface integral equation. An effective method is presented to determine the correct surface current, i.e., the correct surface current, i.e., the correct surface current is composed of the non-resonant mode current and the normalized resonant mode current multiplied by an unknown complex factor. The unknown complex factor can be obtained by employing the condition that the total field inside the conducting closed body must be zero at specified interior points. A numerical example is given for an infinitely long and perfectly conducting circular cylinder at the interior resonance, and the calculated surface currents are in good agreement with the analytical ones. The validity and accuracy of the presented method is thus verified.

Optimal Adjustment Algorithm for <i>p</i>Coordinates and The Starting Point in Interior Point Methods

Optimal adjustment algorithm for p coordinates is a generalization of the optimal pair adjustment algorithm for linear programming, which in turn is based on von Neumann’s algorithm. Its main advantages are simplicity and quick progress in the early iterations. In this work, to accelerate the convergence of the interior point method, few iterations of this generalized algorithm are applied to the Mehrotra’s heuristic, which determines the starting point for the interior point method in the PCx software. Computational experiments in a set of linear programming problems have shown that this approach reduces the total number of iterations and the running time for many of them, including large-scale ones.

Interior-Point Methods Applied to the Predispatch Problem of a Hydroelectric System with Scheduled Line Manipulations

Transmission line manipulations in a power system are necessary for the execution of preventative or corrective main- tenance in a network, thus ensuring the stability of the system. In this study, primal-dual interior-point methods are used to minimize costs and losses in the generation and transmission of the predispatch active power flow in a hydroelectric system with previously scheduled line manipulations for preventative maintenance, over a period of twenty-four hours. The matrix structure of this problem and the modification that it imposes on the system is also broached in this study. From the computational standpoint, the effort required to solve a problem with or without line manipulations is similar, and the reasons for this are also discussed in this study. Computational results sustain our findings.

Low-order Wavefront Error Compensation for Multi-field of Lithography Projection Objective Based on Interior Point Method

Low-order wavefront error account for a large proportion of wave aberrations.A compensation method for low order aberration of projection lithography objective based on Interior Point Method is presented.Compensation model between wavefront error and degree of movable lens freedom is established.Converting over-determined system to underdetermined system,the compensation is solved by Interior Point Method(IPM).The presented method is compared with direct solve the over-determined system.Then,other algorithm GA,EA and PS is compared with IPM.Simulation and experimental results show that the presented compensation method can obtained compensation with less residuals compared with direct solve the over-determined system.Also,the presented compensation method can reduce computation time and obtain results with less residuals compare with AGA,EA and PS.Moreover,after compensation,RMS of wavefront error of the experimental lithography projection objective decrease from 56.05 nm to 17.88 nm.

High Order Compact Difference Scheme and Multigrid Method for 2D Elliptic Problems with Variable Coefficients and Interior/Boundary Layers on Nonuniform Grids

In this paper, a high order compact difference scheme and a multigrid method are proposed for solving two-dimensional (2D) elliptic problems with variable coefficients and interior/boundary layers on nonuniform grids. Firstly, the original equation is transformed from the physical domain (with a nonuniform mesh) to the computational domain (with a uniform mesh) by using a coordinate transformation. Then, a fourth order compact difference scheme is proposed to solve the transformed elliptic equation on uniform girds. After that, a multigrid method is employed to solve the linear algebraic system arising from the difference equation. At last, the numerical experiments on some elliptic problems with interior/boundary layers are conducted to show high accuracy and high efficiency of the present method.

Power Generation Expansion Planning Using an Interior Point with Cutting Plane （IP/CP） Method

The generation expansion planning is one of complex mixed-integer optimization problems, which involves a large number of continuous or discrete decision variables and constraints. In this paper, an interior point with cutting plane （IP/CP） method is proposed to solve the mixed-integer optimization problem of the electrical power generation expansion planning. The IP/CP method could improve the overall efficiency of the solution and reduce the computational time. Proposed method is combined with the Bender＇s decomposition technique in order to decompose the generation expansion problem into a master investment problem and a slave operational problem. The numerical example is presented to compare with the effectiveness of the proposed algorithm.

Element-free Galerkin method for free vibration of rectangular plates with interior elastic point supports and elastically restrained edges

The element-free Galerkin method is proposed to solve free vibration of rectangular plates with finite interior elastic point supports and elastically restrained edges.Based on the extended Hamilton＇s principle for the elastic dynamics system,the dimensionless equations of motion of rectangular plates with finite interior elastic point supports and the edge elastically restrained are established using the element-free Galerkin method.Through numerical calculation,curves of the natural frequency of thin plates with three edges simply supported and one edge elastically restrained,and three edges clamped and the other edge elastically restrained versus the spring constant,locations of elastic point support and the elastic stiffness of edge elastically restrained are obtained.Effects of elastic point supports and edge elastically restrained on the free vibration characteristics of the thin plates are analyzed.

Efficient Calculation of the Radar Cross Section at the Interior Resonance by the Inverse Power Method

It is well known that the incorrect results will be given using either the electric or magnetic field integral equation to calculate the radar cross section (RCS) of a closed body at the interior resonance. In this paper, an effective iterative technique is used to correct the calculated surface current density from the electric field integral equation. The radar cross section is computed for an infinite conducting circular cylinder at the interior resonance, and the obtained results are in good agreement with the analytical results. The backscattering cross section of an infinite triangular cylinder in the vicinity of a resonant frequency is also calculated. It is shown that the presence method is efficient and accurate.

基于障碍函数内点法的防御武器配系部署建模与智能优化

针对防空任务中我方多平台、多武器、多区域部署带来的防御武器配系难以建模和实时优化难的问题,在考虑敌我双方攻防武器对抗博弈的条件下,提出了一种基于障碍函数内点法的我方防御武器部署优化模型,并综合武器防御效能、防御成本、保卫目标的资产价值等指标对模型进行智能优化解算与分析.首先,建立我方部阵地、防御武器与保卫目标的参数化模型,并建立我方武器对于敌方武器拦截的概率函数与约束条件;然后,将防御武器优化部署问题转化为性能指标函数为凸函数的无约束优化问题;最后,引入障碍函数内点法对其进行快速求解,给出了防御阵地武器部署的最优配置方案.所提方法充分考虑了来袭目标的不同类型、异构特性以及大气层内外防御的多元化火力运用方式;能够在具有混合整数非线性、约束强耦合、变量规模大等特征的防御武器配系场景下快速给出最优配置结果.并且,通过数值仿真验证了在对抗博弈条件下所提部署建模与智能优化方法的有效性与优越性.

基于概率最优潮流的电力系统灵活性量化评估方法

可再生能源发电具有波动性和随机性,高比例可再生能源的接入给电力系统的灵活性带来挑战。为此,提出一种基于概率最优潮流的电力系统灵活性量化评估方法。首先,构建电力系统灵活性资源模型。采用k-means聚类方法处理历史数据以生成场景,基于马尔可夫链模型和Copula函数构建考虑时间相关性的风电、光伏出力及负荷波动概率模型。其次,将经济成本与系统灵活性关联,在考虑系统灵活性裕度期望、缺额期望和不足概率的基础上,建立计及运行经济性的量化评估指标。第三,构建含灵活性资源的概率最优潮流模型,采用蒙特卡罗模拟方法和基于跟踪中心轨迹内点法估计系统状态和评估指标。以IEEE RTS-24系统为算例进行分析,结果表明合理配置可再生能源和储能装置有助于提升系统灵活性和运行经济性。

A NEWTON-TYPE GLOBALLY CONVERGENT INTERIOR-POINT METHOD TO SOLVE MULTI-OBJECTIVE OPTIMIZATION PROBLEMS

This paper proposes an interior-point technique for detecting the nondominated points of multi-objective optimization problems using the direction-based cone method.Cone method decomposes the multi-objective optimization problems into a set of single-objective optimization problems.For this set of problems,parametric perturbed KKT conditions are derived.Subsequently,an interior point technique is developed to solve the parametric perturbed KKT conditions.A differentiable merit function is also proposed whose stationary point satisfies the KKT conditions.Under some mild assumptions,the proposed algorithm is shown to be globally convergent.Numerical results of unconstrained and constrained multi-objective optimization test problems are presented.Also,three performance metrics(modified generational distance,hypervolume,inverted generational distance)are used on some test problems to investigate the efficiency of the proposed algorithm.We also compare the results of the proposed algorithm with the results of some other existing popular methods.