A New Active Set Algorithm for Box Constrained Optimization
From MaRDI portal
Publication:3440221
DOI10.1137/050635225zbMath1165.90570OpenAlexW2151898625MaRDI QIDQ3440221
William W. Hager, Hongchao Zhang
Publication date: 22 May 2007
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e9d034c70b78dc7265cdf5536fc375b5c53fb477
conjugate gradient methodbox constrained optimizationactive set algorithmASACBBdegenerate optimizationcyclic BB methodnonmonotone gradient projectionCG{\_}DESCENT
Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Complexity and performance of numerical algorithms (65Y20)
Related Items
A two-stage active-set algorithm for bound-constrained optimization, Modeling and optimization of an ammonia reactor using a penalty-like method, Computational experience with numerical methods for nonnegative least-squares problems, On the convergence of an active-set method for ℓ1minimization, Projection algorithms for nonconvex minimization with application to sparse principal component analysis, Second-order negative-curvature methods for box-constrained and general constrained optimization, An active set truncated Newton method for large-scale bound constrained optimization, Numerical treatment of nonlinear MHD Jeffery-Hamel problems using stochastic algorithms, LMBOPT: a limited memory method for bound-constrained optimization, Efficient unconstrained black box optimization, On the rate of convergence of projected Barzilai–Borwein methods, A decomposition method for large-scale box constrained optimization, An active set algorithm for nonlinear optimization with polyhedral constraints, A new solver for the elastic normal contact problem using conjugate gradients, deflation, and an FFT-based preconditioner, Optimal weed population control using nonlinear programming, Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search, Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm, A practical relative error criterion for augmented Lagrangians, An optimal subgradient algorithm for large-scale bound-constrained convex optimization, Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems, A parallel algorithm for the concurrent atomistic-continuum methodology, Evaluating bound-constrained minimization software, An active set feasible method for large-scale minimization problems with bound constraints, A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions, A tensor optimization algorithm for computing Lagrangians of hypergraphs, A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering, PAL-Hom method for QP and an application to LP, An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization, A novel projected gradient-like method for optimization problems with simple constraints, On the stationarity for nonlinear optimization problems with polyhedral constraints, Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints, On the nonmonotonicity degree of nonmonotone line searches, A multivariate spectral projected gradient method for bound constrained optimization, Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy, Total Variation Based Community Detection Using a Nonlinear Optimization Approach, An active-set projected trust region algorithm for box constrained optimization problems, A cyclic projected gradient method, Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization, A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand, Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization, An active set limited memory BFGS algorithm for bound constrained optimization, Stopping rules and backward error analysis for bound-constrained optimization, A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization, Active Set Complexity of the Away-Step Frank--Wolfe Algorithm, W-methods in optimal control, The bound-constrained conjugate gradient method for non-negative matrices, An accurate active set conjugate gradient algorithm with project search for bound constrained optimization, Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization, Gradient methods exploiting spectral properties, Improving ultimate convergence of an augmented Lagrangian method, Prediction-correction method with BB step sizes, A Subspace Modified PRP Method for Large-scale Nonlinear Box-Constrained Optimization, Augmented Lagrangian method within L-shaped method for stochastic linear programs, Non-negative moment fitting quadrature rules for fictitious domain methods, FaRSA for ℓ1-regularized convex optimization: local convergence and numerical experience, An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices, A dual spectral projected gradient method for log-determinant semidefinite problems, Stochastic numerical treatment for solving Troesch's problem, Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization, PNKH-B: A Projected Newton--Krylov Method for Large-Scale Bound-Constrained Optimization, Globally convergent DC trust-region methods, Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization, A hybrid algorithm for solving minimization problem over (R,S)-symmetric matrices with the matrix inequality constraint, An accurate active set Newton algorithm for large scale bound constrained optimization., Proximal methods for nonlinear programming: Double regularization and inexact subproblems, A Morley finite element method for the displacement obstacle problem of clamped Kirchhoff plates, An active set quasi-Newton method with projected search for bound constrained minimization, Sample size selection in optimization methods for machine learning, Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization, A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables, An algorithm for the fast solution of symmetric linear complementarity problems, On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex, Quasi-Newton acceleration for equality-constrained minimization, Bio-inspired computing platform for reliable solution of Bratu-type equations arising in the modeling of electrically conducting solids, A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization, Conjugate gradient method for the linear complementarity problem withs-matrix, Optimization of dynamic mechanical response of a composite plate using multi-field coupling with thermal constraints, A convexity enforcing \(C^0\) interior penalty method for the Monge-Ampère equation on convex polygonal domains, An affine-scaling interior-point CBB method for box-constrained optimization, Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization, A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs, Projection onto a Polyhedron that Exploits Sparsity, Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization, First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants, Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves, On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence, Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient, An active-set algorithmic framework for non-convex optimization problems over the simplex, AN ADAPTIVE GRADIENT ALGORITHM FOR LARGE-SCALE NONLINEAR BOUND CONSTRAINED OPTIMIZATION, Parallel implementation of augmented Lagrangian method within L-shaped method for stochastic linear programs, Complexity and performance of an Augmented Lagrangian algorithm, A trust region method based on a new affine scaling technique for simple bounded optimization, A non-monotonic method for large-scale non-negative least squares, Parallel generalized Lagrange-Newton method for fully coupled solution of PDE-constrained optimization problems with bound-constraints, A decomposition method for Lasso problems with zero-sum constraint, Hybrid limited memory gradient projection methods for box-constrained optimization problems, An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem, A reduced proximal-point homotopy method for large-scale non-convex BQP
Uses Software
Cites Work
