Regularity of optimal sets for some functional involving eigenvalues of an operator in divergence form

In this paper we consider minimizers of the functional$\min \{{\lambda }_1(\mathrm{\Omega })+\cdots +{\lambda }_k(\mathrm{\Omega })+\mathrm{\Lambda }|\mathrm{\Omega }|,:\mathrm{\Omega }\subset D\text{ open}\}$ where $D\subset {\mathbb{R}}^d$ is a bounded open set and where $0<{\lambda }_1(\mathrm{\Omega })\le \cdots \le {\lambda }_k(\mathrm{\Omega })$ are the first k eigenvalues on Ω of an operator in divergence form with Dirichlet boundary condition and with Hölder continuous coefficients. We prove that the optimal sets ${\mathrm{\Omega }}^{⁎}$ have finite perimeter and that their free boundary $\partial {\mathrm{\Omega }}^{⁎}\cap D$ is composed of a regular part, which is locally the graph of a $C^{1,\alpha }$-regular function, and a singular part, which is empty if $d<d^{⁎}$, discrete if $d=d^{⁎}$ and of Hausdorff dimension at most $d-d^{⁎}$ if $d>d^{⁎}$, for some $d^{⁎}\in \{5,6,7\}$.     

Statistical Optimization of Flavonoid and Antioxidant Recovery from Macerated Chinese and Malaysian Lotus Root (Nelumbo nucifera) Using Response Surface Methodology

In this study, the combination of parameters required for optimal extraction of anti-oxidative components from the Chinese lotus (CLR) and Malaysian lotus (MLR) roots were carefully investigated. Box–Behnken design was employed to optimize the pH (X₁: 2–3), extraction time (X₂: 0.5–1.5 h) and solvent-to-sample ratio (X₃: 20–40 mL/g) to obtain a high flavonoid yield with high % DPPH_sc free radical scavenging and Ferric-reducing power assay (FRAP). The analysis of variance clearly showed the significant contribution of quadratic model for all responses. The optimal conditions for both Chinese lotus (CLR) and Malaysian lotus (MLR) roots were obtained as: CLR: X₁ = 2.5; X₂ = 0.5 h; X₃ = 40 mL/g; MLR: X₁ = 2.4; X₂ = 0.5 h; X₃ = 40 mL/g. These optimum conditions gave (a) Total flavonoid content (TFC) of 0.599 mg PCE/g sample and 0.549 mg PCE/g sample, respectively; (b) % DPPH_sc of 48.36% and 29.11%, respectively; (c) FRAP value of 2.07 mM FeSO₄ and 1.89 mM FeSO₄, respectively. A close agreement between predicted and experimental values was found. The result obtained succinctly revealed that the Chinese lotus exhibited higher antioxidant and total flavonoid content when compared with the Malaysia lotus root at optimum extraction condition.     

Equivalence of variational inequality problems to unconstrained minimization

In this paper we propose a class of merit functions for variational inequality problems (VI). Through these merit functions, the variational inequality problem is cast as unconstrained minimization problem. We estimate the growth rate of these merit functions and give conditions under which the stationary points of these functions are the solutions of VI. This work was supported by the state key project “Scientific and Engineering Computing”.     

k-树的补图的最小填充和树宽

一个图的最小填充问题是寻求边数最少的弦母图,一个图的树宽问题是寻求团数最小的弦母图,这两个问题分别在稀疏矩阵计算及图的算法设计中有非常重要的作用．一个k-树G的补图G称为k-补树．本文给出了k-补树G的最小填充数f(G) 及树宽TW(G)．     

Well-Posedness by Perturbations of Variational Problems

In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented.     

BoneRoute: An Adaptive Memory-Based Method for Effective Fleet Management

This paper presents an adaptive memory-based method for solving the Capacitated Vehicle Routing Problem (CVRP), called BoneRoute. The CVRP deals with the problem of finding the optimal sequence of deliveries conducted by a fleet of homogeneous vehicles, based at one depot, to serve a set of customers. The computational performance of the BoneRoute was found to be very efficient, producing high quality solutions over two sets of well known case studies examined.     

一类含参广义集值拟变分包含组的解的灵敏性分析

本文引入了一类新的含参广义集值拟变分包含组,应用隐预解算子技巧,建立了该类变分包含组与一类不动点问题的等价性,在适当的条件下,分析了含参广义集值拟变分包含组的解的灵敏性,所得结果推广改进了最新文献中的许多结果．     

Minimal Ellipsoid Circumscribing a Polytope Defined by a System of Linear Inequalities

In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven.     

Solving Problems with Min-Type Functions by Disjunctive Programming

We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency.