Pages that link to "Item:Q4377570"
From MaRDI portal
The following pages link to Box Constrained Quadratic Programming with Proportioning and Projections (Q4377570):
Displaying 49 items.
- On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature (Q297833) (← links)
- Optimal iterative QP and QPQC algorithms (Q338894) (← links)
- An active set algorithm for nonlinear optimization with polyhedral constraints (Q341314) (← links)
- Augmented Lagrangian active set methods for obstacle problems (Q597187) (← links)
- Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints (Q626646) (← links)
- An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications (Q715072) (← links)
- Signorini problem with a solution dependent coefficient of friction (model with given friction): Approximation and numerical realization. (Q851671) (← links)
- An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum (Q858185) (← links)
- An affine-scaling interior-point CBB method for box-constrained optimization (Q1013965) (← links)
- A scalable FETI-DP algorithm for a semi-coercive variational inequality (Q1033436) (← links)
- A class of methods for solving large, convex quadratic programs subject to box constraints (Q1177230) (← links)
- An algorithm for the numerical realization of 3D contact problems with Coulomb friction. (Q1426784) (← links)
- On a splitting type algorithm for the numerical realization of contact problems with Coulomb friction (Q1600773) (← links)
- Implementation of the fixed point method in contact problems with Coulomb friction based on a dual splitting type technique (Q1602777) (← links)
- A decomposition method for large-scale box constrained optimization (Q1644498) (← links)
- Projector preconditioning and transformation of basis in FETI-DP algorithms for contact problems (Q1761646) (← links)
- Nonmonotone strategy for minimization of quadratics with simple constraints. (Q1771833) (← links)
- FETI based algorithms for contact problems: Scalability, large displacements and 3D Coulomb friction (Q1777123) (← links)
- Solution of contact problems by FETI domain decomposition with natural coarse space projections (Q1841034) (← links)
- Scalability and FETI based algorithm for large discretized variational inequalities (Q1861354) (← links)
- Duality based domain decomposition with proportioning for the solution of free boundary problems (Q1917850) (← links)
- Separable spherical constraints and the decrease of a quadratic function in the gradient projection step (Q1955575) (← links)
- A scalable TFETI algorithm for two-dimensional multibody contact problems with friction (Q1959466) (← links)
- LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
- A subspace-accelerated split Bregman method for sparse data recovery with joint \(\ell_1\)-type regularizers (Q2208931) (← links)
- A scalable FETI-DP algorithm with non-penetration mortar conditions on contact interface (Q2271948) (← links)
- Approximation and numerical realization of 2D contact problems with Coulomb friction and a solution-dependent coefficient of friction (Q2433763) (← links)
- A Robin algorithm for unilateral contact problems (Q2476548) (← links)
- A sequential method for a class of box constrained quadratic programming problems (Q2483014) (← links)
- A scalable FETI-DP algorithm for a coercive variational inequality (Q2486136) (← links)
- A Solver for Nonconvex Bound-Constrained Quadratic Optimization (Q3454512) (← links)
- Scalable TFETI algorithm for the solution of multibody contact problems of elasticity (Q3567324) (← links)
- Semi–Smooth Newton Methods for Variational Inequalities of the First Kind (Q4423113) (← links)
- (Q4508860) (← links)
- On Regularization and Active-set Methods with Complexity for Constrained Optimization (Q4641664) (← links)
- A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables (Q4687242) (← links)
- A Subspace Modified PRP Method for Large-scale Nonlinear Box-Constrained Optimization (Q4899102) (← links)
- Newton projection with proportioning using iterative linear algebra for model predictive control with long prediction horizon (Q5198056) (← links)
- Generalized Conjugate Gradient Methods for <i>ℓ</i><sub>1</sub> Regularized Convex Quadratic Programming with Finite Convergence (Q5219295) (← links)
- Proportioning with second-order information for model predictive control (Q5268930) (← links)
- Mixed finite element approximation of 3D contact problems with given friction: Error analysis and numerical realization (Q5315471) (← links)
- Contact on Multiprocessor Environment: from Multicontact Problems to Multiscale Approaches (Q5324231) (← links)
- A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions (Q5348467) (← links)
- Minimizing quadratic functions with separable quadratic constraints (Q5436913) (← links)
- A filter-trust-region method for simple-bound constrained optimization (Q5437529) (← links)
- Duality-based domain decomposition with natural coarse-space for variational inequalities (Q5928303) (← links)
- Efficient contact solvers based on domain decomposition techniques. (Q5948895) (← links)
- On the stationarity for nonlinear optimization problems with polyhedral constraints (Q6126646) (← links)
- An active set method for bound-constrained optimization (Q6661109) (← links)
