Results 241 to 250 of about 314,654 (293)

The multipliers‐free domain decomposition methods

Numerical Methods for Partial Differential Equations, 2009
AbstractThis article concludes the development and summarizes a new approach to dual‐primal domain decomposition methods (DDM), generally referred to as “the multipliers‐free dual‐primal method.” Contrary to standard approaches, these new dual‐primal methods are formulated without recourse to Lagrange‐multipliers.
Herrera, Ismael, Yates, Robert A.
openaire   +2 more sources

Approximations to the Multiplier Method

SIAM Journal on Numerical Analysis, 1985
The author analyzes approximations to the multiplier method for solving optimization problems. In particular, the effect of replacing the constrained problem by the unconstrained optimization of a penalized Lagrangian over a subspace instead of a Hilbert space, is considered. Some applications to nonlinear optimal control are discussed.
openaire   +2 more sources

Multiplier methods for convex programming

1973 IEEE Conference on Decision and Control including the 12th Symposium on Adaptive Processes, 1973
A combined primal-dual and penalty method is given for solving the nonlinear programming problem. The algorithm generalizes the "method of multipliers" and is applicable to problems with both equality and inequality constraints. The algorithm is defined for a broad class of "penalized Lagrangians," and is shown to be globally convergent when applied to
B. Kort, D. Bertsekas
openaire   +1 more source

A New Lagrangian Multiplier Method

2012 Fifth International Joint Conference on Computational Sciences and Optimization, 2012
In this paper, a new augmented Lagrangian function with 4-piecewise linear NCP function is introduce for the solution of nonlinear prgramming problems with equality constrained and ineqality constaianed. It is proved that a solution of the original constrained problem and corresponding values of Lagrange multipliers can be found by solving a ...
Youlin Shang, Shengli Guo, Muhua Liu
openaire   +1 more source

Quadratic multiplier method convergence

Journal of Optimization Theory and Applications, 1976
In a recent paper (Ref. 1), the author briefly mentioned a variant of Hestenes' method of multipliers which would converge quadratically. This note examines that method in detail and provides some examples. In the quadratic-linear case, this algorithm converges in one iteration.
openaire   +1 more source

The role of the multipliers in the multiplier method

Journal of Optimization Theory and Applications, 1985
The paper studies the role of the multipliers when the multiplier method is applied as a computational technique for minimizing penalized cost functionals for optimal control problems characterized by linear systems and integral quadratic costs.
openaire   +2 more sources

Method for Designing Efficient Mixed Radix Multipliers

Circuits, Systems, and Signal Processing, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pettenghi, H., Pratas, F., Sousa, L.
openaire   +1 more source

Method of Lagrange Multipliers

2012
This method is intended for conditional inequalities. It requires elementary skills of differential calculus but it is very easy to apply. We’ll give the main theorem, without proof, and we’ll introduce some exercises to see how this method works.
openaire   +1 more source

Multiplier Method for Predicting Limb-Length Discrepancy*

The Journal of Bone and Joint Surgery-American Volume, 2000
In patients with a congenital or developmental limb-length discrepancy, the short limb grows at a rate proportional to that of the normal, long limb. This is the basis of predicting limb-length discrepancy with existing methods, which are complicated and require multiple data points.
D, Paley, A, Bhave, J E, Herzenberg, J R, Bowen   +3 more
openaire   +2 more sources

Optimization Problems: Duality and Multiplier Methods.

1978
Abstract : Research under this grant during the period 1977-1981 resulted in 20 technical articles, two books and a Ph.D. thesis. The work is summarized under the following headings: (1) nonlinear programming algorithms, (2) multistage stochastic optimization, (3) networks and monotropic programming, (4) sub-gradient analysis and nonsmooth optimization,
openaire   +1 more source