Convex Programming with Separable Ellipsoidal Constraints: Application in Contact Problems with Orthotropic Friction
From MaRDI portal
Publication:5264976
DOI10.1007/978-3-319-08025-3_7zbMath1327.90208OpenAlexW92542725WikidataQ109654941 ScholiaQ109654941MaRDI QIDQ5264976
Radek Kučera, Tomáš Kozubek, Jaroslav Haslinger
Publication date: 21 July 2015
Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-08025-3_7
Related Items (2)
The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints ⋮ On the inexact symmetrized globally convergent semi-smooth Newton method for 3D contact problems with Tresca friction: the R-linear convergence rate
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A theoretically supported scalable TFETI algorithm for the solution of multibody 3D contact problems with friction
- Qualitative analysis of 3D elastostatic contact problems with orthotropic Coulomb friction and solution-dependent coefficients of friction
- An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
- Optimal quadratic programming algorithms. With applications to variational inequalities
- Lectures on Modern Convex Optimization
- Approximation of the signorini problem with friction, obeying the coulomb law
- A Scalable TFETI Based Algorithm for 2D and 3D Frictionless Contact Problems
- An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints
- Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
- Trust Region Methods
- Minimizing quadratic functions with separable quadratic constraints
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
This page was built for publication: Convex Programming with Separable Ellipsoidal Constraints: Application in Contact Problems with Orthotropic Friction