New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
From MaRDI portal
Publication:2492668
DOI10.1007/S10107-005-0595-2zbMath1134.90030OpenAlexW1991907403MaRDI QIDQ2492668
Publication date: 14 June 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0595-2
Related Items (74)
A matrix-free trust-region Newton algorithm for convex-constrained optimization ⋮ Optimal \(L_2\)-norm empirical importance weights for the change of probability measure ⋮ Stable equilibrium configuration of two bar truss by an efficient nonmonotone global Barzilai-Borwein gradient method in a fuzzy environment ⋮ A quadratic programming flux correction method for high-order DG discretizations of \(S_N\) transport ⋮ Neural blind deconvolution with Poisson data ⋮ Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time ⋮ Sparse Approximations with Interior Point Methods ⋮ Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules ⋮ An efficient global algorithm for a class of indefinite separable quadratic programs ⋮ LMBOPT: a limited memory method for bound-constrained optimization ⋮ Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ Partial spectral projected gradient method with active-set strategy for linearly constrained optimization ⋮ A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints ⋮ A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems ⋮ Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming ⋮ A joint matrix minimization approach for multi-image face recognition ⋮ Fast optimization-based conservative remap of scalar fields through aggregate mass transfer ⋮ Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian ⋮ Multimaterial topology optimization by volume constrained Allen-Cahn system and regularized projected steepest descent method ⋮ A penalty algorithm for solving convex separable knapsack problems ⋮ On a Reduction for a Class of Resource Allocation Problems ⋮ An optimal subgradient algorithm for large-scale bound-constrained convex optimization ⋮ Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems ⋮ Adjoint-free calculation method for conditional nonlinear optimal perturbations ⋮ Fast algorithm for the quadratic knapsack problem ⋮ Numerical methods for parameter estimation in Poisson data inversion ⋮ A Newton's method for the continuous quadratic knapsack problem ⋮ Robust enhanced indexation optimization with sparse industry Layout constraint ⋮ On the steplength selection in gradient methods for unconstrained optimization ⋮ Minimum variance allocation among constrained intervals ⋮ Unnamed Item ⋮ Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds ⋮ An easily implementable algorithm for efficient projection onto the ordered weighted \(\ell_1\) norm ball ⋮ A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations ⋮ An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints ⋮ An overview of nonlinear optimization ⋮ Optimization-based, property-preserving algorithm for passive tracer transport ⋮ A two-phase method for solving continuous rank-one quadratic knapsack problems ⋮ A new analysis on the Barzilai-Borwein gradient method ⋮ A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints ⋮ The 2-coordinate descent method for solving double-sided simplex constrained minimization problems ⋮ Finding the projection onto the intersection of a closed half-space and a variable box ⋮ Efficient projected gradient methods for cardinality constrained optimization ⋮ An alternating extragradient method with non Euclidean projections for saddle point problems ⋮ Prediction-correction method with BB step sizes ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ A parallel quadratic programming method for dynamic optimization problems ⋮ A new modified Barzilai-Borwein gradient method for the quadratic minimization problem ⋮ On the working set selection in gradient projection-based decomposition techniques for support vector machines ⋮ Fast algorithm for singly linearly constrained quadratic programs with box-like constraints ⋮ A quadratic penalty method for hypergraph matching ⋮ Simple solution methods for separable mixed linear and quadratic knapsack problem ⋮ On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds ⋮ Nonlinear optimization and support vector machines ⋮ A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables ⋮ Nonlinear optimization and support vector machines ⋮ ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration ⋮ On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex ⋮ An efficient Hessian based algorithm for singly linearly and box constrained least squares regression ⋮ A framework of constraint preserving update schemes for optimization on Stiefel manifold ⋮ A Variable Metric Forward-Backward Method with Extrapolation ⋮ A parallel decomposition algorithm for training multiclass kernel-based vector machines ⋮ On the long-only minimum variance portfolio under single factor model ⋮ Communication-Efficient Property Preservation in Tracer Transport ⋮ Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds ⋮ On the inexact scaled gradient projection method ⋮ Variable fixing method by weighted average for the continuous quadratic knapsack problem ⋮ Stabilization of nonautonomous parabolic equations by a single moving actuator ⋮ Fast computation of global solutions to the single-period unit commitment problem ⋮ Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property ⋮ Feasible Barzilai–Borwein-like methods for extreme symmetric eigenvalue problems ⋮ Scaling techniques for gradient projection-type methods in astronomical image deblurring ⋮ An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem ⋮ Inertial projection and contraction algorithms with larger step sizes for solving quasimonotone variational inequalities
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An O(n) algorithm for quadratic knapsack problems
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- Constrained global optimization: algorithms and applications
- Algorithms for bound constrained quadratic programming problems
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- An improved gradient projection-based decomposition technique for support vector machines
- On the asymptotic behaviour of some new gradient methods
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Multipoint methods for separable nonlinear networks
- Two-Point Step Size Gradient Methods
- Quasi-Newton Updates with Bounds
- A polynomially bounded algorithm for a singly constrained quadratic program
- Gradient Method with Retards and Generalizations
- Inexact spectral projected gradient methods on convex sets
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique for Newton’s Method
- Validation of subgradient optimization
- On the Barzilai and Borwein choice of steplength for the gradient method
- Benchmarking optimization software with performance profiles.
- Adaptive two-point stepsize gradient algorithm
This page was built for publication: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
