On the Maximization of a Concave Quadratic Function with Box Constraints
From MaRDI portal
Recommendations
- New algorithms for maximization of concave functions with box constraints
- scientific article; zbMATH DE number 4005983
- scientific article; zbMATH DE number 1199796
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Algorithms for bound constrained quadratic programming problems
Cited in
(30)- A trust-region-approach for solving a parameter estimation problem from the biotechnology area
- 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
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Nonmonotone strategy for minimization of quadratics with simple constraints.
- Solution of contact problems by FETI domain decomposition with natural coarse space projections
- Scalability and FETI based algorithm for large discretized variational inequalities
- A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
- A subspace-accelerated split Bregman method for sparse data recovery with joint _1-type regularizers
- Globally convergent primal-dual active-set methods with inexact subproblem solves
- On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature
- Optimal iterative QP and QPQC algorithms
- A solver for nonconvex bound-constrained quadratic optimization
- Scalable TFETI algorithm for the solution of multibody contact problems of elasticity
- scientific article; zbMATH DE number 4005983 (Why is no real title available?)
- New algorithms for maximization of concave functions with box constraints
- Augmented lagrangians and sphere packing problems
- scientific article; zbMATH DE number 724207 (Why is no real title available?)
- Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy∗
- scientific article; zbMATH DE number 1513394 (Why is no real title available?)
- A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables
- Proportioning with second-order information for model predictive control
- A reduced-space algorithm for minimizing _1-regularized convex functions
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- Duality-based domain decomposition with natural coarse-space for variational inequalities
- On the stationarity for nonlinear optimization problems with polyhedral constraints
- Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
- Bi-affine scaling iterative method for convex quadratic programming with bound constraints
- An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
This page was built for publication: On the Maximization of a Concave Quadratic Function with Box Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4294751)
