Convex optimization techniques in compliant assembly simulation
DOI10.1007/S11081-020-09493-ZzbMATH Open1455.74072OpenAlexW3009274308MaRDI QIDQ2218917FDOQ2218917
Olga Minevich, Michael Kokkolaras, Margarita Petukhova, Maria Stefanova, Stanislav Baklanov, Sergey Lupuleac, Boris Grigor'ev
Publication date: 18 January 2021
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-020-09493-z
Recommendations
- The adaptation of interior point method for solving the quadratic programming problems arising in the assembly of deformable structures
- Newton projection method as applied to assembly simulation
- Large quadratic programming problems generated by rigid body simulation
- Methods for convex and general quadratic programming
- A computational study of the use of an optimization-based method for simulating large multibody systems†
quadratic programmingcontact problemaircraft assemblymassive computationvariation simulation analysis
Numerical optimization and variational techniques (65K10) Quadratic programming (90C20) Contact in solid mechanics (74M15) Compliance or weight optimization in solid mechanics (74P05) Numerical and other methods in solid mechanics (74S99)
Cites Work
- A numerically stable dual method for solving strictly convex quadratic programs
- On the Implementation of a Primal-Dual Interior Point Method
- Numerical methods for nonsmooth dynamical systems. Applications in mechanics and electronics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex programming in Hilbert space
- Variational inequalities
- Computational Contact Mechanics
- Title not available (Why is that?)
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- On the Goldstein-Levitin-Polyak gradient projection method
- Iterative Krylov Methods for Large Linear Systems
- On an instance of the inverse shortest paths problem
- A dual-active-set algorithm for positive semi-definite quadratic programming
- On the quadratic programming algorithm of Goldfarb and Idnani
- Projected Newton Methods for Optimization Problems with Simple Constraints
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Gradient Projection Method under Mild Differentiability Conditions
- Hybrid metaheuristics for constrained portfolio selection problems
- Parallel Processing and Applied Mathematics
- Starting-point strategies for an infeasible potential reduction method
- Title not available (Why is that?)
- An incomplete Cholesky factorization for dense symmetric positive definite matrices
- Comparative study between Lemke's method and the interior point method for the monotone linear complementarity problem
- Proportioning with second-order information for model predictive control
- The Contact Problem of a Plate Pressed Between Two Spheres
Cited In (7)
- Composite structures optimization using sequential convex programming
- The customization of the geodesic algorithm for optimal fastener arrangement
- The relative formulation of the quadratic programming problem in the aircraft assembly modeling
- Newton projection method as applied to assembly simulation
- Large quadratic programming problems generated by rigid body simulation
- The adaptation of interior point method for solving the quadratic programming problems arising in the assembly of deformable structures
- Decomposition method for solving the quadratic programming problem in the aircraft assembly modeling
Uses Software
This page was built for publication: Convex optimization techniques in compliant assembly simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2218917)
