Nonsmooth Optimization Method for Image Restoration

Author(s):  
Kazufumi Ito ◽  
Karl Kunisch

Abstract In this paper we discuss applications of the numerical optimization methods for nonsmooth optimization, developed in [IK1] for the variational formulation of image restoration problems involving bounded variation type energy criterion. The Uzawa’s algorithm, first order augmented Lagrangian methods and Newton-like update using the active set strategy are described.

Author(s):  
Michael Benz ◽  
Markus Hehn ◽  
Christopher H. Onder ◽  
Lino Guzzella

This paper proposes a novel optimization method that allows a reduction in the pollutant emission of diesel engines during transient operation. The key idea is to synthesize optimal actuator commands using reliable models of the engine system and powerful numerical optimization methods. The engine model includes a mean-value engine model for the dynamics of the gas paths, including the turbocharger of the fuel injection, and of the torque generation. The pollutant formation is modeled using an extended quasi-static modeling approach. The optimization substantially changes the input signals, such that the engine model is enabled to extrapolate all relevant outputs beyond the regular operating area. A feedforward controller for the injected fuel mass is used to eliminate the nonlinear path constraints during the optimization. The model is validated using experimental data obtained on a transient engine test bench. A direct single shooting method is found to be most effective for the numerical optimization. The results show a significant potential for reducing the pollutant emissions during transient operation of the engine. The optimized input trajectories derived assist the design of sophisticated engine control systems.


Author(s):  
Francisco Casesnoves

<p>In a previous contribution, the mathematical-computational base of Interior Optimization Method was demonstrated. Electronics applications were performed with numerical optimization data and graphical proofs. In this evoluted-improved paper a series of electronics applications of Interior Optimization in superconductors BCS algorithms/theory are shown. In addition, mathematical developments of Interior Optimization Methods related to systems of Nonlinear Equations are proven. The nonlinear multiobjective optimization problem constitutes a difficult task to find/determine a global minimum, approximated-global minimum, or a convenient local minimum whith/without constraints. Nonlinear systems of equations principles set the base in the previous article for further development of Interior Optimization and Interior-Graphical Optimization [Casesnoves, 2016-7]. From Graphical Optimization 3D optimization stages [Casesnoves, 2016-7], the demonstration that solution of nonlinear systems of equations is not unique in general emerges. Software-engineering and computational simulations are shown with electronics superconductors [several elements, Type 1 superconductors] and electronics physics applications. Extensions to similar applications for materials-tribology models and Biomedical Tribology are explained.</p>


Author(s):  
R. Oftadeh ◽  
M. J. Mahjoob

This paper presents a novel structural optimization algorithm based on group hunting of animals such as lions, wolves, and dolphins. Although these hunters have differences in the way of hunting but they are common in that all of them look for a prey in a group. The hunters encircle the prey and gradually tighten the ring of siege until they catch the prey. In addition, each member of the group corrects its position based on its own position and the position of other members. If the prey escapes from the ring, the hunters reorganize the group to siege the prey again. A benchmark numerical optimization problems is presented to show how the algorithm works. Three benchmark structural optimization problems are also presented to demonstrate the effectiveness and robustness of the proposed Hunting Search (HuS) algorithm for structural optimization. The objective in these problems is to minimize the weight of bar trusses. Both sizing and layout optimization variables are included, too. The proposed algorithm is compared with other global optimization methods such as CMLPSA (Corrected Multi-Level & Multi-Point Simulated Annealing) and HS (Harmony Search). The results indicate that the proposed method is a powerful search and optimization technique. It yields comparable and in some cases, better solutions compared to those obtained using current algorithms when applied to structural optimization problems.


2016 ◽  
Vol 25 (02) ◽  
pp. 1550030 ◽  
Author(s):  
Gai-Ge Wang ◽  
Amir H. Gandomi ◽  
Amir H. Alavi ◽  
Suash Deb

A multi-stage krill herd (MSKH) algorithm is presented to fully exploit the global and local search abilities of the standard krill herd (KH) optimization method. The proposed method involves exploration and exploitation stages. The exploration stage uses the basic KH algorithm to select a good candidate solution set. This phase is followed by fine-tuning a good candidate solution in the exploitation stage with a focused local mutation and crossover (LMC) operator in order to enhance the reliability of the method for solving global numerical optimization problems. Moreover, the elitism scheme is introduced into the MSKH method to guarantee the best solution. The performance of MSKH is verified using twenty-five standard and rotated and shifted benchmark problems. The results show the superiority of the proposed algorithm to the standard KH and other well-known optimization methods.


2021 ◽  
Author(s):  
Turki Binbakir

Abstract The aim of this research is to propose a new technique to improve Bees Algorithm. Bees Algorithm is one of the well-known metaheuristic optimization method which have been subject to several attempts to improve it by overcoming some of the weaknesses. The suggested method is derived from the numerical optimization methods, namely bracketing and region elimination methods. It employs an adaption of the regional elimination method to achieve abandonment and reduction of search space within the Bees Algorithm. The utilization of the exhaustive search involves exploring the whole search space to find the optimum at equally located intervals. To assess performance, the proposed method was evaluated on twenty-four benchmark functions and two engineering problems. The acquired result indicated a statistically significant improvement.


Author(s):  
Wienczyslaw Stalewski

The optimization methods are increasingly used to solve challenging problems of aeronautical engineering. Typically, the optimization methods are utilized in design of aircraft airframe or its structure. The presented study is focused on an improvement of aircraft-flight-control procedures through the numerical optimization approach. The optimization problems concern selected phases of flight of light gyroplane - a rotorcraft using an unpowered rotor in autorotation to develop lift and an engine-powered propeller to provide thrust. An original methodology of computational simulation of rotorcraft flight was developed and implemented. In this approach the aircraft-motion equations are solved step-by-step, simultaneously with the solution of the Unsteady Reynolds-Averaged Navier-Stokes equations, which is conducted to assess aerodynamic forces acting on the aircraft. As a numerical optimization method, the BFGS algorithm was adapted. The developed methodology was applied to optimize the flight-control procedures in selected stages of gyroplane flight in direct proximity of the ground, where properly conducted control of the aircraft is critical to ensure flight safety and performance. The results of conducted computational optimizations proved qualitative correctness of the developed methodology. The research results can be helpful in design of easy-to-control gyroplanes and also in the training of pilots of this type of rotorcraft.


Sign in / Sign up

Export Citation Format

Share Document