๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An algorithm for linearly constrained convex nondifferentiable minimization problems

โœ Scribed by Krzysztof C Kiwiel

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
595 KB
Volume
105
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Two-phase Heuristic Algorithm for Delay
Two-phase Heuristic Algorithm for Delay Constrained Minimal Cost Loop Problem
โœ Yong-Jin Lee; Tai-Yun Kim ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 589 KB

This article presents a heuristic algorithm that consists of two phases for the DMCLP under the constraints that the number of nodes served by a single loop is limited and networks mean delay is within the desired time.

A Newton-type algorithm for solving an e
A Newton-type algorithm for solving an extremal constrained interpolation problem
โœ Krassimira Vlachkova ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 856 KB

Given convex scattered data in R 3 we consider the constrained interpolation problem of finding a smooth, minimal L p -norm (1 < p < โˆž) interpolation network that is convex along the edges of an associated triangulation. In previous work the problem has been reduced to the solution of a nonlinear sy