Ordinal optimization is a tool to reduce the computational burden in simulation-based optimization problems. So far, the major effort in this field focuses on single-objective optimization. In this paper, we extend this to multiobjective optimization and develop vector ordinal optimization, which is different from the one introduced in Ref. 1. Alignment probability and ordered performance curve (OPC) are redefined for multiobjective optimization. Our results lead to quantifiable subset selection sizes in the multiobjective case, which supplies guidance in solving practical problems, as demonstrated by the examples in this paper.This paper was supported in part by Army Contract DAAD19-01-1-0610, AFOSR Contract F49620-01-1-0288, and a contract with United Technology Research Center (UTRC). The first author received additional funding from NSF of China Grants 60074012 and 60274011, Ministry of Education (China), and a Tsinghua University (Beijing, China) Fundamental Research Funding Grant, and the NCET program of China.The authors are grateful to and benefited from two rounds of reviews from three anonymous referees. 相似文献
Yb(OTf)3 catalyzed efficient Hantzsch reaction via four-component coupling reactions of aldehydes, dimedone, ethyl acetoacetate and ammonium acetate at ambient temperature was described as the preparation of polyhydroquinoline derivatives. The process presented here is operationally simple, environmentally benign and has excellent yield. Furthermore, the catalyst can be recovered conveniently and reused efficiently. 相似文献
This paper reports the EMF(electromotive force) measurements of cell (A) without liquid junction at five temperatures from 278.15 to 318.15 K. Pt|H2(101.325kPa)|HCl(m1),GaCl3(m2),H2O|Ag|AgCl (A) The measurements on the system HCl+GaCl3+H2O was carried out in an appropriate concentration of hydrochloric acid when the concentration of hydrochloric acid is not lower than 0.13 mol/kg the hydrolysis of Ga3+ can be avoided or elimited1. The standard association constant, KAS ,… 相似文献
Let be a locally strongly convex hypersurface, given by the graph of a convex function xn+1=f(x1,…,xn) defined in a convex domain Ω⊂Rn. M is called a α-extremal hypersurface, if f is a solution of
The cubic boron nitride (cBN) is a kind of artificial electro-optic (EO) crystal, and we have not found any relative reports so far. Because the artificial synthetic cBN wafers are very small and hard, the wafers cannot be cut into rectangular slabs. The polarizer-sample-λ/4 retardation plate (compensator)-analyzer (PSCA) transverse EO modulator has to be adjusted to the minute irregular octahedron of cBN wafers. When the applied voltage is along [1 1 1] direction of the wafer, due to refraction, the angle between the incident beam direction and the (1 1 1) plane (top or bottom plane) of the wafer should be 25.4°, and the angle between the polarization direction of the polarizer and the plane of incidence should be 50.8° by calculation, respectively. The half-wave voltage of the cBN sample was obtained for the first time, by means of detection of the output optic signals from the modulator with and without an applied electric field on the sample, respectively. Furthermore, the linear EO coefficient was obtained, . The analysis of the experimental resulting error was carried out. 相似文献
This paper is devoted to the theoretical and numerical investigation of an augmented Lagrangian method for the solution of optimization problems with geometric constraints. Specifically, we study situations where parts of the constraints are nonconvex and possibly complicated, but allow for a fast computation of projections onto this nonconvex set. Typical problem classes which satisfy this requirement are optimization problems with disjunctive constraints (like complementarity or cardinality constraints) as well as optimization problems over sets of matrices which have to satisfy additional rank constraints. The key idea behind our method is to keep these complicated constraints explicitly in the constraints and to penalize only the remaining constraints by an augmented Lagrangian function. The resulting subproblems are then solved with the aid of a problem-tailored nonmonotone projected gradient method. The corresponding convergence theory allows for an inexact solution of these subproblems. Nevertheless, the overall algorithm computes so-called Mordukhovich-stationary points of the original problem under a mild asymptotic regularity condition, which is generally weaker than most of the respective available problem-tailored constraint qualifications. Extensive numerical experiments addressing complementarity- and cardinality-constrained optimization problems as well as a semidefinite reformulation of MAXCUT problems visualize the power of our approach.
It is well known that the classical Ascoli-Arzelà theorem is powerful technique to give a necessary and sufficient condition for investigating the relative compactness of a family of abstract continuous functions, while it is limited to finite compact interval. In this paper, we shall generalize the Ascoli-Arzelà theorem on an infinite interval. As its application, we investigate an initial value problem for fractional evolution equations on infinite interval in the sense of Hilfer type, which is a generalization of both Riemann-Liuoville and Caputo fractional derivatives. Our methods are based on the Hausdorff theorem, classical/generalized Ascoli-Arzelà theorem, Schauder fixed point theorem, Wright function, and Kuratowski measure of noncompactness. We obtain the existence of mild solutions on an infinite interval when the semigroup is compact as well as noncompact. 相似文献
In this paper, we present a two-grid finite element method for the Allen-Cahn equation with the logarithmic potential. This method consists of two steps. In the first step, based on a fully implicit finite element method, the Allen-Cahn equation is solved on a coarse grid with mesh size H. In the second step, a linearized system whose nonlinear term is replaced by the value of the first step is solved on a fine grid with mesh size h. We give the energy stabilities of the traditional finite element method and the two-grid finite element method. The optimal convergence order of the two-grid finite element method in H1 norm is achieved when the mesh sizes satisfy h = O(H2). Numerical examples are given to demonstrate the validity of the proposed scheme. The results show that the two-grid method can save the CPU time while keeping the same convergence rate. 相似文献