Box Constrained Quadratic Programming with Proportioning and Projections
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1057696
- Quadratic programming problems with M-matrices and box constraints
- Box-constrained quadratic programs with fixed charge variables
- On box constrained concave quadratic optimization
- On nonconvex quadratic programming with box constraints
- A projective method for linear programming with box-type constraints
- scientific article; zbMATH DE number 4201503
- A projection and contraction method for convex quadratic programming
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
Cited in
(51)- An affine-scaling interior-point CBB method for box-constrained optimization
- A scalable FETI-DP algorithm for a semi-coercive variational inequality
- A class of methods for solving large, convex quadratic programs subject to box constraints
- An algorithm for the numerical realization of 3D contact problems with Coulomb friction.
- On a splitting type algorithm for the numerical realization of contact problems with Coulomb friction
- Implementation of the fixed point method in contact problems with Coulomb friction based on a dual splitting type technique
- A decomposition method for large-scale box constrained optimization
- Projector preconditioning and transformation of basis in FETI-DP algorithms for contact problems
- Nonmonotone strategy for minimization of quadratics with simple constraints.
- FETI based algorithms for contact problems: Scalability, large displacements and 3D Coulomb friction
- Solution of contact problems by FETI domain decomposition with natural coarse space projections
- Scalability and FETI based algorithm for large discretized variational inequalities
- Duality based domain decomposition with proportioning for the solution of free boundary problems
- 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
- LMBOPT: a limited memory method for bound-constrained optimization
- A subspace-accelerated split Bregman method for sparse data recovery with joint _1-type regularizers
- A scalable FETI-DP algorithm with non-penetration mortar conditions on contact interface
- Approximation and numerical realization of 2D contact problems with Coulomb friction and a solution-dependent coefficient of friction
- A Robin algorithm for unilateral contact problems
- A sequential method for a class of box constrained quadratic programming problems
- A scalable FETI-DP algorithm for a coercive variational inequality
- On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature
- Optimal iterative QP and QPQC algorithms
- An active set algorithm for nonlinear optimization with polyhedral constraints
- A solver for nonconvex bound-constrained quadratic optimization
- Scalable TFETI algorithm for the solution of multibody contact problems of elasticity
- Semi–Smooth Newton Methods for Variational Inequalities of the First Kind
- scientific article; zbMATH DE number 1513394 (Why is no real title available?)
- On regularization and active-set methods with complexity for constrained optimization
- A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables
- A subspace modified PRP method for large-scale nonlinear box-constrained optimization
- Newton projection with proportioning using iterative linear algebra for model predictive control with long prediction horizon
- Generalized conjugate gradient methods for _1 regularized convex quadratic programming with finite convergence
- Proportioning with second-order information for model predictive control
- Mixed finite element approximation of 3D contact problems with given friction: Error analysis and numerical realization
- Contact on Multiprocessor Environment: from Multicontact Problems to Multiscale Approaches
- A reduced-space algorithm for minimizing _1-regularized convex functions
- Minimizing quadratic functions with separable quadratic constraints
- A filter-trust-region method for simple-bound constrained optimization
- Duality-based domain decomposition with natural coarse-space for variational inequalities
- Efficient contact solvers based on domain decomposition techniques.
- Augmented Lagrangian active set methods for obstacle problems
- On the stationarity for nonlinear optimization problems with polyhedral constraints
- Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
- An active set method for bound-constrained optimization
- A variable transformation to box constraints for solving variational inequalities
- An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
- Non-Negative Conjugate Gradients
- Signorini problem with a solution dependent coefficient of friction (model with given friction): Approximation and numerical realization.
- An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum
This page was built for publication: Box Constrained Quadratic Programming with Proportioning and Projections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377570)
