Convex Combinations of Minimal Graphs
Given a collection of minimal graphs, 𝑀1,𝑀2,…,𝑀𝑛, with isothermal parametrizations in terms of the Gauss map and height differential, we give sufficient conditions on 𝑀1,𝑀2,…,𝑀𝑛 so that a convex combination of them will be a minimal graph. We will then provide two examples, taking a convex combinati...
Saved in:
| Main Authors: | Michael Dorff, Ryan Viertel, Magdalena Wołoszkiewicz |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/2012/724268 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Iterative Schemes for Convex Minimization Problems with Constraints
by: Lu-Chuan Ceng, et al.
Published: (2014-01-01) -
Weakly toll convexity and proper interval graphs
by: Mitre C. Dourado, et al.
Published: (2024-04-01) -
A Decomposition Algorithm for Convex Nondifferentiable Minimization with Errors
by: Yuan Lu, et al.
Published: (2012-01-01) -
Closed Locally Minimal Networks on the Surfaces of Convex Polyhedra
by: N. P. Strelkova
Published: (2013-10-01) -
Scheduling Jobs to Minimize a Convex Function of Resource Usage
by: Evelin Szögi, et al.
Published: (2023-09-01)