نتایج جستجو برای: lagrangian optimization
تعداد نتایج: 338580 فیلتر نتایج به سال:
The Generalized Mutual Assignment Problem (GMAP) is a distributed combinatorial optimization problem in which, with no centralized control, multiple agents search for an optimal assignment of goods that satisfies their individual knapsack constraints. Previously, in the GMAP protocol, problem instances were assumed to be feasible, meaning that the total capacities of the agents were large enoug...
We study a class of methods for solving convex programs, which are based on nonquadratic Augmented Lagrangians for which the penalty parameters are functions of the multipliers. This gives rise to lagrangians which are nonlinear in the multipliers. Each augmented lagrangian is speciied by a choice of a penalty function ' and a penalty-updating function. The requirements on ' are mild, and allow...
This paper presents a numerical study of a stochastic augmented Lagrangian algorithm to solve continuous constrained global optimization problems. The algorithm approximately solves a sequence of bound constrained subproblems whose objective function penalizes equality and inequality constraints violation and depends on the Lagrange multiplier vectors and a penalty parameter. Each subproblem is...
In this paper we present an accelerated Augmented Lagrangian Method for the solution of constrained convex optimization problems in the Basis Pursuit De-Noising (BPDN) form. The technique relies on on Augmented Lagrangian Methods (ALMs), particularly the Alternating Direction Method of Multipliers (ADMM). Here, we present an application of the Constrained Split Augmented Lagrangian Shrinkage Al...
We discuss a Lagrangian-relaxation-based heuristics for dealing with feature selection in a standard L1 norm Support Vector Machine (SVM) framework for binary classification. The feature selection model we adopt is a Mixed Binary Linear Programming problem and it is suitable for a Lagrangian relaxation approach. Based on a property of the optimal multiplier setting, we apply a consolidated nons...
Accelerated gradient methods play a central role in optimization, achieving optimal rates in many settings. Although many generalizations and extensions of Nesterov's original acceleration method have been proposed, it is not yet clear what is the natural scope of the acceleration concept. In this paper, we study accelerated methods from a continuous-time perspective. We show that there is a La...
ABSTRACT We consider the global and local convergence properties of a class of augmented Lagrangian methods for solving nonlinear programming problems. In these methods, linear and more general constraints are handled in different ways. The general constraints are combined with the objective function in an augmented Lagrangian. The iteration consists of solving a sequence of subproblems; in eac...
Augmented Lagrangian algorithms are very popular tools for solving nonlinear programming problems. At each outer iteration of these methods a simpler optimization problem is solved, for which efficient algorithms can be used, especially when the problems are large. The most famous Augmented Lagrangian algorithm for minimization with inequality constraints is known as Powell-Hestenes-Rockafellar...
We consider the task of design optimization, where the constraint is a state equation that can only be solved by a typically rather slowly converging fixed point solver. This process can be augmented by a corresponding adjoint solver, and based on the resulting approximate reduced derivatives, also an optimization iteration, which actually changes the design. To coordinate the three iterative p...
In this study, the direct method including evaluation criteria of handling qualities as optimization method’s constraints are carried out to complement problems of the indirect method that assesses whether a flight control system designed by existing optimization techniques satisfies handling qualities or not. For the direct method, co-evolutionary augmented Lagrangian method is used. F-16 long...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید