Pages that link to "Item:Q2492668"
From MaRDI portal
The following pages link to New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds (Q2492668):
Displaying 50 items.
- An efficient global algorithm for a class of indefinite separable quadratic programs (Q304230) (← links)
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- Fast optimization-based conservative remap of scalar fields through aggregate mass transfer (Q347769) (← links)
- A new analysis on the Barzilai-Borwein gradient method (Q457542) (← links)
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
- An alternating extragradient method with non Euclidean projections for saddle point problems (Q480931) (← links)
- A parallel quadratic programming method for dynamic optimization problems (Q499159) (← links)
- A new modified Barzilai-Borwein gradient method for the quadratic minimization problem (Q511967) (← links)
- Fast algorithm for singly linearly constrained quadratic programs with box-like constraints (Q513719) (← links)
- On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds (Q537652) (← links)
- A quadratic penalty method for hypergraph matching (Q683734) (← links)
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
- A framework of constraint preserving update schemes for optimization on Stiefel manifold (Q747775) (← links)
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules (Q837553) (← links)
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization (Q849145) (← links)
- Adjoint-free calculation method for conditional nonlinear optimal perturbations (Q887056) (← links)
- Numerical methods for parameter estimation in Poisson data inversion (Q890095) (← links)
- A Newton's method for the continuous quadratic knapsack problem (Q892383) (← links)
- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds (Q1029281) (← links)
- A joint matrix minimization approach for multi-image face recognition (Q1656900) (← links)
- Multimaterial topology optimization by volume constrained Allen-Cahn system and regularized projected steepest descent method (Q1667260) (← links)
- Efficient projected gradient methods for cardinality constrained optimization (Q1729947) (← links)
- Prediction-correction method with BB step sizes (Q1731902) (← links)
- An efficient Hessian based algorithm for singly linearly and box constrained least squares regression (Q2049105) (← links)
- On the long-only minimum variance portfolio under single factor model (Q2060386) (← links)
- On the inexact scaled gradient projection method (Q2070333) (← links)
- Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
- Stabilization of nonautonomous parabolic equations by a single moving actuator (Q2075105) (← links)
- Fast computation of global solutions to the single-period unit commitment problem (Q2082175) (← links)
- Inertial projection and contraction algorithms with larger step sizes for solving quasimonotone variational inequalities (Q2114595) (← links)
- A matrix-free trust-region Newton algorithm for convex-constrained optimization (Q2119752) (← links)
- A quadratic programming flux correction method for high-order DG discretizations of \(S_N\) transport (Q2125461) (← links)
- LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
- Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming (Q2156911) (← links)
- ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration (Q2284080) (← links)
- Optimal \(L_2\)-norm empirical importance weights for the change of probability measure (Q2361444) (← links)
- Stable equilibrium configuration of two bar truss by an efficient nonmonotone global Barzilai-Borwein gradient method in a fuzzy environment (Q2361517) (← links)
- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time (Q2364490) (← links)
- An optimal subgradient algorithm for large-scale bound-constrained convex optimization (Q2408897) (← links)
- On the steplength selection in gradient methods for unconstrained optimization (Q2422865) (← links)
- Minimum variance allocation among constrained intervals (Q2423792) (← links)
- Finding the projection onto the intersection of a closed half-space and a variable box (Q2450616) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- A penalty algorithm for solving convex separable knapsack problems (Q2660092) (← links)
- Fast algorithm for the quadratic knapsack problem (Q2674729) (← links)
- A Variable Metric Forward-Backward Method with Extrapolation (Q2818247) (← links)
- Feasible Barzilai–Borwein-like methods for extreme symmetric eigenvalue problems (Q2867405) (← links)
- Scaling techniques for gradient projection-type methods in astronomical image deblurring (Q2868153) (← links)
