Optimal quadratic programming algorithms. With applications to variational inequalities
From MaRDI portal
Recommendations
Cited in
(74)- Specialized fast algorithms for IQC feasibility and optimization problems.
- A TFETI domain decomposition solver for elastoplastic problems
- A quasi-static interface damage model with cohesive cracks: SQP-SGBEM implementation
- On a scalable nonparametric denoising of time series signals
- Projector preconditioning and transformation of basis in FETI-DP algorithms for contact problems
- Approximation and numerical realization of 3D quasistatic contact problems with Coulomb friction
- Scalable total BETI based solver for 3D multibody frictionless contact problems in mechanical engineering
- Separable spherical constraints and the decrease of a quadratic function in the gradient projection step
- A scalable TFETI algorithm for two-dimensional multibody contact problems with friction
- The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints
- Efficient methods for solving the Stokes problem with slip boundary conditions
- A dual gradient-projection method for large-scale strictly convex quadratic problems
- An accelerated augmented Lagrangian algorithm with adaptive orthogonalization strategy for bound and equality constrained quadratic programming and its application to large-scale contact problems of elasticity
- Force transmission characteristics in a multiple-fulcrum supporting platform with heavy loads
- Theory of functional connections applied to quadratic and nonlinear programming under equality constraints
- Bayesian inversion for steady flow in fractured porous media with contact on fractures and hydro-mechanical coupling
- Energetic versus maximally-dissipative local solutions of a quasi-static rate-independent mixed-mode delamination model
- QPLIB: a library of quadratic programming instances
- Solving quadratic programs to high precision using scaled iterative refinement
- The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction
- Optimality properties of an augmented Lagrangian method on infeasible problems
- An energy based formulation of a quasi-static interface damage model with a multilinear cohesive law
- Regularized robust optimization: the optimal portfolio execution case
- Improved robustness and consistency of 3D contact algorithms based on a dual mortar approach
- On R-linear convergence of semi-monotonic inexact augmented Lagrangians for saddle point problems
- Highly scalable hybrid domain decomposition method for the solution of huge scalar variational inequalities
- Application of the conjugate gradient method to solving discrete contact problems for an elastic half-plane
- Algorithm for solving discrete contact problems for an elastic strip
- Algorithm for solving discrete contact problems for an elastic layer
- Solving Contact Mechanics Problems with PERMON
- An interior-point algorithm for the minimization arising from 3D contact problems with friction
- Verification of functional a posteriori error estimates for obstacle problem in 1D
- Direct algorithm for the solution of two-sided obstacle problems with M-matrix.
- Engineering Multibody Contact Problems Solved by Scalable TBETI
- Using Krylov subspace and spectral methods for solving complementarity problems in many-body contact dynamics simulation
- Variationally consistent discretization schemes and numerical algorithms for contact problems
- On R-linear convergence of semi-monotonic inexact augmented Lagrangians for bound and equality constrained quadratic programming problems with application
- Optimal iterative QP and QPQC algorithms
- A solver for nonconvex bound-constrained quadratic optimization
- BEM solution of delamination problems using an interface damage and plasticity model
- Parallel solution of contact shape optimization problems based on total FETI domain decomposition method
- Monotonicity recovering and accuracy preserving optimization methods for postprocessing finite element solutions
- A theoretically supported scalable TFETI algorithm for the solution of multibody 3D contact problems with friction
- Handling infeasibility in a large-scale nonlinear optimization algorithm
- A domain decomposition method for two-body contact problems with Tresca friction
- On regularization and active-set methods with complexity for constrained optimization
- On the Moore–Penrose inverse in solving saddle‐point systems with singular diagonal blocks
- On the inexact symmetrized globally convergent semi-smooth Newton method for 3D contact problems with Tresca friction: the R-linear convergence rate
- Mixed Tabu machine for portfolio optimization problem
- Scalable TFETI with optional preconditioning by conjugate projector for transient frictionless contact problems of elasticity
- Conjugate gradients for symmetric positive semidefinite least-squares problems
- Verification of functional a posteriori error estimates for obstacle problem in 2D
- Newton projection with proportioning using iterative linear algebra for model predictive control with long prediction horizon
- On the complexity of an inexact restoration method for constrained optimization
- Entropy Satisfying Schemes for Computing Selection Dynamics in Competitive Interactions
- Primary method of quadratic programming in multivariable predictive control with constraints
- Convex programming with separable ellipsoidal constraints: application in contact problems with orthotropic friction
- Proportioning with second-order information for model predictive control
- Qualitative analysis of 3D elastostatic contact problems with orthotropic Coulomb friction and solution-dependent coefficients of friction
- Reorthogonalization-based stiffness preconditioning in FETI algorithms with applications to variational inequalities.
- Inexact and primal multilevel FETI‐DP methods: a multilevel extension and interplay with BDDC
- Parallel global optimization algorithm with uniform convergence for solving a set of constrained global optimization problems
- Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
- Cholesky decomposition of a positive semidefinite matrix with known kernel
- Stopping rules and backward error analysis for bound-constrained optimization
- Scalable hybrid TFETI-DP methods for large boundary variational inequalities
- Quantitative analysis of nonlinear multifidelity optimization for inverse electrophysiology
- Application of the conjugate gradient method for solving unilateral discrete contact problems for an elastic half-space
- Hybrid TBETI domain decomposition for huge 2D scalar variational inequalities
- An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
- Domain decomposition preconditioners for Schur complement systems arising in structured nonlinear optimization problems
- Algorithms of solution of problems of quadratic programming and of optimal guaranteed estimation
- Scalable total BETI based algorithm for 3D coercive contact problems of linear elastostatics
- Merging of Bézier curves with box constraints
This page was built for publication: Optimal quadratic programming algorithms. With applications to variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960535)