Search results for Optimization

IDEAL PLANAR FLUID FLOW OVER A SUBMERGED OBSTACLE: REVIEW AND EXTENSION
Part of
- Incompressible inviscid fluids
- Basic methods in fluid mechanics
LAWRENCE K. FORBES, STEPHEN J. WALTERS, GRAEME C. HOCKING
Journal:

The ANZIAM Journal / Volume 63 / Issue 4 / October 2021

Published online by Cambridge University Press:

25 October 2021, pp. 377-419
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation
A classical problem in free-surface hydrodynamics concerns flow in a channel, when an obstacle is placed on the bottom. Steady-state flows exist and may adopt one of three possible configurations, depending on the fluid speed and the obstacle height; perhaps the best known has an apparently uniform flow upstream of the obstacle, followed by a semiinfinite train of downstream gravity waves. When time-dependent behaviour is taken into account, it is found that conditions upstream of the obstacle are more complicated, however, and can include a train of upstream-advancing solitons. This paper gives a critical overview of these concepts, and also presents a new semianalytical spectral method for the numerical description of unsteady behaviour.

Frontmatter
Nisheeth K. Vishnoi, Yale University, Connecticut
Book:

Algorithms for Convex Optimization

Published online:

24 September 2021

Print publication:

07 October 2021, pp i-iv
- Chapter
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Dedication
Nisheeth K. Vishnoi, Yale University, Connecticut
Book:

Algorithms for Convex Optimization

Published online:

24 September 2021

Print publication:

07 October 2021, pp v-vi
- Chapter
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Notation
Nisheeth K. Vishnoi, Yale University, Connecticut
Book:

Algorithms for Convex Optimization

Published online:

24 September 2021

Print publication:

07 October 2021, pp xv-xvi
- Chapter
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

4 - Convex Optimization and Efficiency
Nisheeth K. Vishnoi, Yale University, Connecticut
Book:

Algorithms for Convex Optimization

Published online:

24 September 2021

Print publication:

07 October 2021, pp 49-68
- Chapter
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

13 - Ellipsoid Method for Convex Optimization
Nisheeth K. Vishnoi, Yale University, Connecticut
Book:

Algorithms for Convex Optimization

Published online:

24 September 2021

Print publication:

07 October 2021, pp 279-309
- Chapter
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

9 - Newton’s Method
Nisheeth K. Vishnoi, Yale University, Connecticut
Book:

Algorithms for Convex Optimization

Published online:

24 September 2021

Print publication:

07 October 2021, pp 160-184
- Chapter
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

6 - Gradient Descent
Nisheeth K. Vishnoi, Yale University, Connecticut
Book:

Algorithms for Convex Optimization

Published online:

24 September 2021

Print publication:

07 October 2021, pp 84-107
- Chapter
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

2 - Preliminaries
Nisheeth K. Vishnoi, Yale University, Connecticut
Book:

Algorithms for Convex Optimization

Published online:

24 September 2021

Print publication:

07 October 2021, pp 17-34
- Chapter
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Bibliography
Nisheeth K. Vishnoi, Yale University, Connecticut
Book:

Algorithms for Convex Optimization

Published online:

24 September 2021

Print publication:

07 October 2021, pp 310-318
- Chapter
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

1 - Bridging Continuous and Discrete Optimization
Nisheeth K. Vishnoi, Yale University, Connecticut
Book:

Algorithms for Convex Optimization

Published online:

24 September 2021

Print publication:

07 October 2021, pp 1-16
- Chapter
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Acknowledgments
Nisheeth K. Vishnoi, Yale University, Connecticut
Book:

Algorithms for Convex Optimization

Published online:

24 September 2021

Print publication:

07 October 2021, pp xiv-xiv
- Chapter
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Preface
Nisheeth K. Vishnoi, Yale University, Connecticut
Book:

Algorithms for Convex Optimization

Published online:

24 September 2021

Print publication:

07 October 2021, pp xi-xiii
- Chapter
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Contents
Nisheeth K. Vishnoi, Yale University, Connecticut
Book:

Algorithms for Convex Optimization

Published online:

24 September 2021

Print publication:

07 October 2021, pp vii-x
- Chapter
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

8 - Accelerated Gradient Descent
Nisheeth K. Vishnoi, Yale University, Connecticut
Book:

Algorithms for Convex Optimization

Published online:

24 September 2021

Print publication:

07 October 2021, pp 143-159
- Chapter
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

10 - An Interior Point Method for Linear Programming
Nisheeth K. Vishnoi, Yale University, Connecticut
Book:

Algorithms for Convex Optimization

Published online:

24 September 2021

Print publication:

07 October 2021, pp 185-214
- Chapter
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Index
Nisheeth K. Vishnoi, Yale University, Connecticut
Book:

Algorithms for Convex Optimization

Published online:

24 September 2021

Print publication:

07 October 2021, pp 319-324
- Chapter
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

7 - Mirror Descent and the MultiplicativeWeights Update
Nisheeth K. Vishnoi, Yale University, Connecticut
Book:

Algorithms for Convex Optimization

Published online:

24 September 2021

Print publication:

07 October 2021, pp 108-142
- Chapter
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

11 - Variants of Interior Point Method and Self-Concordance
Nisheeth K. Vishnoi, Yale University, Connecticut
Book:

Algorithms for Convex Optimization

Published online:

24 September 2021

Print publication:

07 October 2021, pp 215-247
- Chapter
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

5 - Duality and Optimality
Nisheeth K. Vishnoi, Yale University, Connecticut
Book:

Algorithms for Convex Optimization

Published online:

24 September 2021

Print publication:

07 October 2021, pp 69-83
- Chapter
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Optimization

Refine search

Refine search

Actions for selected content:

3869 results in Optimization

IDEAL PLANAR FLUID FLOW OVER A SUBMERGED OBSTACLE: REVIEW AND EXTENSION

Frontmatter

Dedication

Notation

4 - Convex Optimization and Efficiency

13 - Ellipsoid Method for Convex Optimization

9 - Newton’s Method

6 - Gradient Descent

2 - Preliminaries

Bibliography

1 - Bridging Continuous and Discrete Optimization

Acknowledgments

Preface

Contents

8 - Accelerated Gradient Descent

10 - An Interior Point Method for Linear Programming

Index

7 - Mirror Descent and the MultiplicativeWeights Update

11 - Variants of Interior Point Method and Self-Concordance

5 - Duality and Optimality

Optimization

Refine search

Refine search

Actions for selected content:

Save Search

3869 results in Optimization