• Title/Summary/Keyword: nonsmooth

Search Result 48, Processing Time 0.025 seconds

AN IMPROVED LOCAL CONVERGENCE ANALYSIS FOR SECANT-LIKE METHOD

  • Argyros, Ioannis K.;Hilout, Said
    • East Asian mathematical journal
    • /
    • v.23 no.2
    • /
    • pp.261-270
    • /
    • 2007
  • We provide a local convergence analysis for Secant-like algorithm for solving nonsmooth variational inclusions in Banach spaces. An existence-convergence theorem and an improvement of the ratio of convergence of this algorithm are given under center-conditioned divided difference and Aubin's continuity concept. Our result compare favorably with related obtained in [16].

  • PDF

ON THE CONVERGENCE OF NEWTON'S METHOD AND LOCALLY $H{\ddot{O}}LDERIAN$ OPERATORS

  • Argyros, Ioannis K.
    • The Pure and Applied Mathematics
    • /
    • v.15 no.2
    • /
    • pp.111-120
    • /
    • 2008
  • A semi local convergence analysis is provided for Newton's method in a Banach space setting. The operators involved are only locally Holderian. We make use of a point-based approximation and center-Holderian hypotheses. This approach can be used to approximate solutions of equations involving nonsmooth operators.

  • PDF

A FAST NUMERICAL METHOD FOR SOLVING A REGULARIZED PROBLEM ASSOCIATED WITH OBSTACLE PROBLEMS

  • Yuan, Daming;Li, Xi;Lei, Chengfeng
    • Journal of the Korean Mathematical Society
    • /
    • v.49 no.5
    • /
    • pp.893-905
    • /
    • 2012
  • Kirsi Majava and Xue-Cheng Tai [12] proposed a modified level set method for solving a free boundary problem associated with unilateral obstacle problems. The proximal bundle method and gradient method were applied to solve the nonsmooth minimization problems and the regularized problem, respectively. In this paper, we extend this approach to solve the bilateral obstacle problems and employ Rung-Kutta method to solve the initial value problem derived from the regularized problem. Numerical experiments are presented to verify the efficiency of the methods.

THE LAYOUT PROBLEM OF TWO KINDS OF GRAPH ELEMENTS WITH PERFORMANCE CONSTRAINTS AND ITS OPTIMALITY CONDITIONS

  • ZHANG XU;LANG YANHUAI;FENG ENMIN
    • Journal of applied mathematics & informatics
    • /
    • v.20 no.1_2
    • /
    • pp.209-224
    • /
    • 2006
  • This paper presents an optimization model with performance constraints for two kinds of graph elements layout problem. The layout problem is partitioned into finite subproblems by using graph theory and group theory, such that each subproblem overcomes its on-off nature about optimal variable. Furthermore each subproblem is relaxed and the continuity about optimal variable doesn't change. We construct a min-max problem which is locally equivalent to the relaxed subproblem and develop the first order necessary and sufficient conditions for the relaxed subproblem by virtue of the min-max problem and the theories of convex analysis and nonsmooth optimization. The global optimal solution can be obtained through the first order optimality conditions.

DYNAMIC AND CONTROLLABILITY OF A NONLINEAR WASTEWATER TREATMENT PROBLEM

  • Jourani, Abderrahim;Serhani, Mustapha;Boutoulout, Ali
    • Journal of applied mathematics & informatics
    • /
    • v.30 no.5_6
    • /
    • pp.883-902
    • /
    • 2012
  • In this work we deal with a nonlinear dynamical system, namely the wastewater treatment model. We proceed to a dynamical analysis of the model. Invariance, boundness, controllability and the sensitivity with respect the initial conditions are studied. On the other hand, using the nonsmooth analysis tools, we look for the viability of the model, that is, the necessary and sufficient conditions under which trajectories move in a suitable time-moving sets, to avoid the washing problem (died of bacteria).

RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION

  • LEE, CHANG-OCK;PARK, JONGHO
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.24 no.2
    • /
    • pp.161-197
    • /
    • 2020
  • Total variation minimization is standard in mathematical imaging and there have been numerous researches over the last decades. In order to process large-scale images in real-time, it is essential to design parallel algorithms that utilize distributed memory computers efficiently. The aim of this paper is to illustrate recent advances of domain decomposition methods for total variation minimization as parallel algorithms. Domain decomposition methods are suitable for parallel computation since they solve a large-scale problem by dividing it into smaller problems and treating them in parallel, and they already have been widely used in structural mechanics. Differently from problems arising in structural mechanics, energy functionals of total variation minimization problems are in general nonlinear, nonsmooth, and nonseparable. Hence, designing efficient domain decomposition methods for total variation minimization is a quite challenging issue. We describe various existing approaches on domain decomposition methods for total variation minimization in a unified view. We address how the direction of research on the subject has changed over the past few years, and suggest several interesting topics for further research.

Development of an Educational Simulator of Particle Swarm Optimization: Application to Economic Dispatch Problems (교육용 PSO 시뮬레이터의 개발: 경제급전에의 적용)

  • Lee, Woo-Nam;Jeong, Yun-Won;Lee, Joo-Won;Park, Jong-Bae;Shin, Joong-Rin
    • Proceedings of the KIEE Conference
    • /
    • 2006.11a
    • /
    • pp.198-200
    • /
    • 2006
  • This paper presents a development of an educational simulator of particle swarm optimization (PSO) and application for solving the test functions and economic dispatch (ED) problems with nonsmooth cost functions. A particle swarm optimization is one of the most powerful methods for solving global optimization problems. It is a population-based search algorithm and searches in parallel using a group of particles similar to other AI-based heuristic optimization techniques. In developed simulator, lecturers and students can select the functions for simulation and set the parameters that have an influence on PSO performance. To improve searching capability for ED problems, a crossover operation is proposed to the position update of each individual (CR-PSO). To verify the feasibility of CR-PSO method, numerical studies have been performed for two different sample systems. The proposed CR-PSO method outperforms other algorithms in solving ED problems.

  • PDF

Acoustic Interface Element on Nonconformal Finite Element Mesh for Fluid-Structure Interaction Problem (비적합 유한요소망에 적용가능한 유체-구조물 연결 요소)

  • Cho, Jeong-Rae;Lee, Jin Ho;Cho, Keunhee;Yoon, Hyejin
    • Journal of the Earthquake Engineering Society of Korea
    • /
    • v.27 no.4
    • /
    • pp.163-170
    • /
    • 2023
  • In the fluid-structure interaction analysis, the finite element formulation is performed for the wave equation for dynamic fluid pressure, and the dynamic pressure is defined as a degree of freedom at the fluid nodes. Therefore, to connect the fluid to the structure, it is necessary to connect the degree of freedom of fluid dynamic pressure and the degree of freedom of structure displacement through an interface element derived from the relationship between dynamic pressure and displacement. The previously proposed fluid-structure interface elements use conformal finite element meshes in which the fluid and structure match. However, it is challenging to construct conformal meshes when complex models, such as water purification plants and wastewater treatment facilities, are models. Therefore, to increase modeling convenience, a method is required to model the fluid and structure domains by independent finite element meshes and then connect them. In this study, two fluid-structure interface elements, one based on constraints and the other based on the integration of nonsmooth functions, are proposed in nonconformal finite element meshes for structures and fluids, and their accuracy is verified.