Optimization of triangular networks with spatial constraints
DOI10.1080/10556788.2019.1604703zbMath1502.90127arXiv1811.04721OpenAlexW2951791943MaRDI QIDQ5085265
Hung M. Phan, Valentin R. Koch
Publication date: 27 June 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.04721
convex optimizationprojection methodsDouglas-Rachford splittingmaximum slopealignment constraintminimum slopeoriented slope
Convex programming (90C25) Convex functions and convex programs in convex geometry (52A41) Decomposition methods (49M27) Computer-aided design (modeling of curves and surfaces) (65D17) Convexity of real functions of several variables, generalizations (26B25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Iterative methods for fixed point problems in Hilbert spaces
- Stadium Norm and Douglas-Rachford Splitting: A New Approach to Road Design Optimization
- Introduction to Nonlinear Optimization
- Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
- Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem
- A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- A proximal decomposition method for solving convex variational inverse problems
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- On Projection Algorithms for Solving Convex Feasibility Problems
- A Primal-Dual Splitting Algorithm for Finding Zeros of Sums of Maximal Monotone Operators
- Proximité et dualité dans un espace hilbertien
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Optimization of triangular networks with spatial constraints
