نتایج جستجو برای: Augmented ��-constraint

تعداد نتایج: 128224  

Journal: :Optimization Methods and Software 2016
Andrea Walther Nicolas R. Gauger Lisa Kusch Natalie Richert

For design optimization tasks, quite often a so-called one-shot approach is used. It augments the solution of the state equation with a suitable adjoint solver yielding approximate reduced derivatives that can be used in an optimization iteration to change the design. The coordination of these three iterative processes is well established when only the state equation is considered as equality c...

2004
Xiangyu Kong Chongzhao Han Ruixuan Wei

Aiming at the nonlinear filtering problem that exists when the input and output observation data are both corrupted by noises, a stable total least square adaptive algorithm for the nonlinear Volterra filter is proposed in this paper. Taking the minimum Rayleigh Quotient of the augmented Volterra weight vectors and a constraint to the last element of the augmented Volterra weight vectors via a ...

2007
C. Thitithamrongchai

This paper presents a self-adaptive differential evolution with augmented Lagrange multiplier method (SADE_ALM) for solving optimal power flow (OPF) problems with non-smooth generator fuel cost curves. The SADE_ALM is a modified version of conventional differential evolution (DE) by integrating mutation factor (F ) and crossover constant (CR ) as additional control variables. An augmented Lagra...

2005
Barnaby Martin

We study a class of non-deterministic program schemes with while loops: firstly, augmented with a priority queue for memory; secondly, augmented with universal quantification; and, thirdly, augmented with universal quantification and a stack for memory. We try to relate these respective classes of program schemes to well-known complexity classes and logics. We study classes of structure on whic...

1998
Xue-Cheng Tai Johnny Frøyen Magne S. Espedal Tony F. Chan

Our emphasis is on the numerical treatment of discontinuous coefficient and efficiency of the numerical methods. It is well known that such an inverse problem is illposed. Its numerical solution often suffers from undesirable numerical oscillation and very slow convergence. When the coefficient is smooth, successful numerical methods have been developed in [5] [7]. When the coefficient has larg...

2001
Sheila McIlraith Tran Cao Son

Motivated by the problem of automatically composing network accessible services, such as those on the World Wide Web, this paper proposes an approach to building agent technology based on the the notion of generic procedures and customizing user constraint. We argue that an augmented version of the logic programming language Golog provides a natural formalism for programming Web services. To th...

2016
Canyi Lu Huan Li Zhouchen Lin Shuicheng Yan

The Augmented Lagragian Method (ALM) and Alternating Direction Method of Multiplier (ADMM) have been powerful optimization methods for general convex programming subject to linear constraint. We consider the convex problem whose objective consists of a smooth part and a nonsmooth but simple part. We propose the Fast Proximal Augmented Lagragian Method (Fast PALM) which achieves the convergence ...

Amir Moeintaghavi, Habibollah Ghanbari Hamed Nicknam Mehrdad Radvar Naser Sargolzaei Reza Zare

Background and aim:  Although there have been substantial developments in dental implant therapies, achieving good implant stability (ISQ >60) for implants inserted in augmented sinus sites appears to be challenging in comparison with non-augmented sites due to the high prevalence of bone resorption in posterior regions of maxilla. This study aimed to evaluate and compare the time required to a...

Journal: :Comp. Opt. and Appl. 2008
Ernesto G. Birgin José Mario Martínez

Augmented Lagrangian methods for large-scale optimization usually require efficient algorithms for minimization with box constraints. On the other hand, active-set box-constraint methods employ unconstrained optimization algorithms for minimization inside the faces of the box. Several approaches may be employed for computing internal search directions in the large-scale case. In this paper a mi...

2016
R. Ranjan Y. Feng A. T. Chronopoulos

We study incompressible fluid flow problems with stabilized formulations. We introduce an iterative penalty approach to satisfying the divergence free constraint in the Streamline Upwind Petrov Galerkin (SUPG) and Galerkin Least Squares (GLS) formulations, and prove the stability of the formulation. Equal order interpolations for both velocities and pressure variables are utilized for solving p...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید