Pages that link to "Item:Q4620983"
From MaRDI portal
The following pages link to Consensus-ADMM for General Quadratically Constrained Quadratic Programming (Q4620983):
Displayed 14 items.
- Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization (Q823888) (← links)
- A distributed algorithm for high-dimension convex quadratically constrained quadratic programs (Q2057223) (← links)
- Lopsided shift-splitting preconditioner for saddle point problems with three-by-three structure (Q2167406) (← links)
- A hybrid algorithm for the two-trust-region subproblem (Q2322760) (← links)
- Nonlinear set membership filter with state estimation constraints via consensus-ADMM (Q2681381) (← links)
- A general system for heuristic minimization of convex functions over non-convex sets (Q4638917) (← links)
- Modification of gesture-determined-dynamic function with consideration of margins for motion planning of humanoid robots (Q5082435) (← links)
- A simple effective heuristic for embedded mixed-integer quadratic programming (Q5207801) (← links)
- Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem (Q5231678) (← links)
- An Uncertainty-Weighted Asynchronous ADMM Method for Parallel PDE Parameter Estimation (Q5241247) (← links)
- A Linear-Time Algorithm for Generalized Trust Region Subproblems (Q5853724) (← links)
- Positive semidefinite interval of matrix pencil and its applications to the generalized trust region subproblems (Q6087885) (← links)
- Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem (Q6114784) (← links)
- Efficient min–max MPC: Achieving a large domain of attraction with short horizon (Q6154587) (← links)