Search

Abstract  In this paper, a filled function method for solving constrained global optimization problems is proposed. A filled function is proposed for escaping the current local minimizer of a constrained global optimization problem by combining the idea of filled function in unconstrained global optimization and the idea of penalty function in constrained optimization. Then a filled function method for obtaining a global minimizer or an approximate global minimizer of the constrained global optimization problem is presented. Some numerical results demonstrate the efficiency of this global optimization method for solving constrained global optimization problems. [ABSTRACT FROM AUTHOR]

This paper presents a stabilized meshfree method formulated based on the strong formulation and local approximation using radial basis functions (RBFs). The purpose of this paper is two folds. First, a regularization procedure is developed for stabilizing the solution of the radial point collocation method (RPCM). Second, an adaptive scheme using the stabilized RPCM and residual based error indicator is established. It has been shown in this paper that the features of the meshfree strong-form method can facilitated an easier implementation of adaptive analysis. A new error indicator based on the residual is devised and used in this work. As shown in the numerical examples, the new error indicator can reflect the quality of the local approximation and the global accuracy of the solution. A number of examples have been presented to demonstrate the effectiveness of the present method for adaptive analysis. [ABSTRACT FROM AUTHOR]

Abstract??We study a multiple-succedent sequent calculus with both of the structural rules Left Weakening and Left Contraction but neither of their counterparts on the right, for possible application to the treatment of multiplicative disjunction (fission, ?cotensor?,par) against the background of intuitionistic logic. We find that, as Hirokawa dramatically showed in a 1996 paper with respect to the rules for implication, the rules for this connective render derivable some new structural rules, even though, unlike the rules for implication, these rules are what we callipsilateral: applying such a rule does not make any (sub)formula change sides?from the left to the right of the sequent separator or vice versa. Some possibilities for a semantic characterization of the resulting logic are also explored. The paper concludes with three open questions. [ABSTRACT FROM AUTHOR]