𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation accuracy, gradient methods, and error bound for structured convex optimization

✍ Scribed by Paul Tseng

Publisher
Springer-Verlag
Year
2010
Tongue
English
Weight
471 KB
Volume
125
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A modification of convex approximation m
A modification of convex approximation methods for structural optimization
✍ Wei-Hong Zhang; C. Fleury πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 624 KB

Ah&act--The most popular convex approximation methods used today in structural optimization are discussed in this paper: the convex linearization method (CONLIN), the method of the moving asymptotes (MMA) and the sequential quadratic programming method (SQP). Modifications are made to enhance the re

Existence of approximate solutions and e
Existence of approximate solutions and error bounds for viscoelastic fluid flow: Characteristics method
✍ J. Baranger; A. Machmoum πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 867 KB

In this paper we study a finite element approximation of a steady viscoelastic fluid flow obeying an Oldroyd B type constitutive law. The approximate :stress, velocity, and pressure are, respectively, Pt discontinuous, Pz continuous, PI continuous. We use the method of characteristics for the convec

General Further Discarding Tests in Geom
General Further Discarding Tests in Geometric Branch-and-Bound Methods for Non-Convex Multicriteria Optimization Problems
✍ Daniel Scholz πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 387 KB

## ABSTRACT Using a geometric branch‐and‐bound technique, my goal in this paper is to compute a sharp outer approximation of all Pareto‐optimal solutions in multicriteria optimization problems. To this end, I propose some general further discarding tests that are based on the Fritz John necessary c