Pages that link to "Item:Q1812088"
From MaRDI portal
The following pages link to Large-scale active-set box-constrained optimization method with spectral projected gradients (Q1812088):
Displaying 50 items.
- Packing ellipsoids by nonlinear optimization (Q312475) (← links)
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization (Q429499) (← links)
- Handling infeasibility in a large-scale nonlinear optimization algorithm (Q430999) (← links)
- The bound-constrained conjugate gradient method for non-negative matrices (Q463008) (← links)
- Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems (Q496609) (← links)
- A multivariate spectral projected gradient method for bound constrained optimization (Q629482) (← links)
- Outer trust-region method for constrained optimization (Q637557) (← links)
- Modified active set projected spectral gradient method for bound constrained optimization (Q638841) (← links)
- An active set limited memory BFGS algorithm for bound constrained optimization (Q638888) (← links)
- A feasible direction method for the semidefinite program with box constraints (Q654206) (← links)
- Continuous GRASP with a local active-set method for bound-constrained global optimization (Q708907) (← links)
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Q742114) (← links)
- Impulse noise removal by an adaptive trust-region method (Q780152) (← links)
- An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
- An inexact-restoration method for nonlinear bilevel programming problems (Q839690) (← links)
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization (Q849145) (← links)
- Local convergence of an inexact-restoration method and numerical experiments (Q850815) (← links)
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q870176) (← links)
- An active-set projected trust region algorithm for box constrained optimization problems (Q905153) (← links)
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization (Q929334) (← links)
- Solving bound constrained optimization via a new nonmonotone spectral projected gradient method (Q941611) (← links)
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q955062) (← links)
- Residual algorithm for large-scale positive definite generalized eigenvalue problems (Q975355) (← links)
- An algorithm for the fast solution of symmetric linear complementarity problems (Q998634) (← links)
- Quasi-Newton acceleration for equality-constrained minimization (Q1001193) (← links)
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization (Q1021258) (← links)
- Low order-value optimization and applications (Q1029662) (← links)
- A decomposition method for large-scale box constrained optimization (Q1644498) (← links)
- On the minimization of possibly discontinuous functions by means of pointwise approximations (Q1686551) (← links)
- Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization (Q1722397) (← links)
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach (Q1887860) (← links)
- Evaluating bound-constrained minimization software (Q1928747) (← links)
- An active set feasible method for large-scale minimization problems with bound constraints (Q1928749) (← links)
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization (Q1935275) (← links)
- Global minimization using an augmented Lagrangian method with variable lower-level constraints (Q1960193) (← links)
- A support tool for planning classrooms considering social distancing between students (Q2065002) (← links)
- Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient (Q2082555) (← links)
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
- A decomposition method for Lasso problems with zero-sum constraint (Q2106751) (← links)
- On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees (Q2125571) (← links)
- An augmented Lagrangian method exploiting an active-set strategy and second-order information (Q2139257) (← links)
- LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
- An application-based characterization of dynamical distance geometry problems (Q2174892) (← links)
- On the use of third-order models with fourth-order regularization for unconstrained optimization (Q2182770) (← links)
- A novel projected gradient-like method for optimization problems with simple constraints (Q2190861) (← links)
- Scaled projected-directions methods with application to transmission tomography (Q2218907) (← links)
- Optimality properties of an augmented Lagrangian method on infeasible problems (Q2352419) (← links)
- A two-stage active-set algorithm for bound-constrained optimization (Q2359771) (← links)
- Second-order negative-curvature methods for box-constrained and general constrained optimization (Q2379692) (← links)
- Optimal weed population control using nonlinear programming (Q2398149) (← links)
