A New Active Set Algorithm for Box Constrained Optimization
From MaRDI portal
Recommendations
- Recent advances in bound constrained optimization
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- An active-set projected trust region algorithm for box constrained optimization problems
- Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming
- A survey on the active set methods for box constrained optimization
Cites work
Cited in
(only showing first 100 items - show all)- Quasi-Newton acceleration for equality-constrained minimization
- Conjugate gradient method for the linear complementarity problem withs-matrix
- An affine-scaling interior-point CBB method for box-constrained optimization
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- Numerical treatment of nonlinear MHD Jeffery-Hamel problems using stochastic algorithms
- A decomposition method for large-scale box constrained optimization
- On the nonmonotonicity degree of nonmonotone line searches
- Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization
- Prediction-correction method with BB step sizes
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Evaluating bound-constrained minimization software
- An active set feasible method for large-scale minimization problems with bound constraints
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
- A cyclic projected gradient method
- W-methods in optimal control
- A dual spectral projected gradient method for log-determinant semidefinite problems
- A Morley finite element method for the displacement obstacle problem of clamped Kirchhoff plates
- Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization
- A convexity enforcing C^0 interior penalty method for the Monge-Ampère equation on convex polygonal domains
- Minimization over the _1-ball using an active-set non-monotone projected gradient
- 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
- A reduced proximal-point homotopy method for large-scale non-convex BQP
- LMBOPT: a limited memory method for bound-constrained optimization
- Efficient unconstrained black box optimization
- Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming
- Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm
- A novel projected gradient-like method for optimization problems with simple constraints
- Non-negative moment fitting quadrature rules for fictitious domain methods
- An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices
- Globally convergent DC trust-region methods
- Bio-inspired computing platform for reliable solution of Bratu-type equations arising in the modeling of electrically conducting solids
- Optimization of dynamic mechanical response of a composite plate using multi-field coupling with thermal constraints
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
- A two-stage active-set algorithm for bound-constrained optimization
- Second-order negative-curvature methods for box-constrained and general constrained optimization
- Optimal weed population control using nonlinear programming
- An optimal subgradient algorithm for large-scale bound-constrained convex optimization
- PAL-Hom method for QP and an application to LP
- A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization
- An accurate active set conjugate gradient algorithm with project search for bound constrained optimization
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- A parallel algorithm for the concurrent atomistic-continuum methodology
- Modeling and optimization of an ammonia reactor using a penalty-like method
- Projection onto a polyhedron that exploits sparsity
- Globally convergent primal-dual active-set methods with inexact subproblem solves
- An adaptive gradient algorithm for large-scale nonlinear bound constrained optimization
- 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
- Computational experience with numerical methods for nonnegative least-squares problems.
- On the convergence of an active-set method for _1 minimization
- Improved convergence rates for Lasserre-type hierarchies of upper bounds for box-constrained polynomial optimization
- Recent advances in bound constrained optimization
- Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis
- An active set truncated Newton method for large-scale bound constrained optimization
- scientific article; zbMATH DE number 5670814 (Why is no real title available?)
- An active set algorithm for nonlinear optimization with polyhedral constraints
- On the rate of convergence of projected Barzilai-Borwein methods
- A new solver for the elastic normal contact problem using conjugate gradients, deflation, and an FFT-based preconditioner
- Improving ultimate convergence of an augmented Lagrangian method
- A practical relative error criterion for augmented Lagrangians
- New algorithms for maximization of concave functions with box constraints
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- scientific article; zbMATH DE number 6907388 (Why is no real title available?)
- The bound-constrained conjugate gradient method for non-negative matrices
- FarRSA for \(\ell_1\)-regularized convex optimization: local convergence and numerical experience
- 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
- A survey on the active set methods for box constrained optimization
- Parallel implementation of augmented Lagrangian method within L-shaped method for stochastic linear programs
- Stochastic numerical treatment for solving Troesch's problem
- Active-set identification with complexity guarantees of an almost cyclic 2-coordinate descent method with Armijo line search
- Delayed gradient methods for symmetric and positive definite linear systems
- Total variation based community detection using a nonlinear optimization approach
- Active set complexity of the away-step Frank-Wolfe algorithm
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
- Gradient methods exploiting spectral properties
- PNKH-B: A Projected Newton--Krylov Method for Large-Scale Bound-Constrained Optimization
- A hybrid algorithm for solving minimization problem over (R,S)-symmetric matrices with the matrix inequality constraint
- A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization
- First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants
- On quasi-Newton forward-backward splitting: proximal calculus and convergence
- An efficient hybrid algorithm for the separable convex quadratic knapsack problem
- A reduced-space algorithm for minimizing _1-regularized convex functions
- An accurate active set Newton algorithm for large scale bound constrained optimization.
- A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem
- Complexity and performance of an augmented Lagrangian algorithm
- On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex
- A tensor optimization algorithm for computing Lagrangians of hypergraphs
- A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in m n real matrix space with application in image clustering
- On the stationarity for nonlinear optimization problems with polyhedral constraints
- Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy
- Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
- A multivariate spectral projected gradient method for bound constrained optimization
- An active set limited memory BFGS algorithm for bound constrained optimization
- Stopping rules and backward error analysis for bound-constrained optimization
Describes a project that uses
Uses Software
This page was built for publication: A New Active Set Algorithm for Box Constrained Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3440221)
