Pages that link to "Item:Q3440221"
From MaRDI portal
The following pages link to A New Active Set Algorithm for Box Constrained Optimization (Q3440221):
Displaying 50 items.
- Modeling and optimization of an ammonia reactor using a penalty-like method (Q274997) (← links)
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis (Q312468) (← links)
- An active set truncated Newton method for large-scale bound constrained optimization (Q316586) (← links)
- An active set algorithm for nonlinear optimization with polyhedral constraints (Q341314) (← links)
- A new solver for the elastic normal contact problem using conjugate gradients, deflation, and an FFT-based preconditioner (Q348456) (← links)
- A practical relative error criterion for augmented Lagrangians (Q378086) (← links)
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization (Q429499) (← links)
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand (Q429526) (← links)
- The bound-constrained conjugate gradient method for non-negative matrices (Q463008) (← links)
- Stochastic numerical treatment for solving Troesch's problem (Q506366) (← links)
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions (Q513166) (← links)
- An accurate active set Newton algorithm for large scale bound constrained optimization. (Q548593) (← links)
- Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints (Q626646) (← links)
- A multivariate spectral projected gradient method for bound constrained optimization (Q629482) (← links)
- An active set limited memory BFGS algorithm for bound constrained optimization (Q638888) (← links)
- Stopping rules and backward error analysis for bound-constrained optimization (Q639367) (← links)
- Augmented Lagrangian method within L-shaped method for stochastic linear programs (Q669327) (← links)
- Sample size selection in optimization methods for machine learning (Q715253) (← links)
- An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
- An active-set projected trust region algorithm for box constrained optimization problems (Q905153) (← links)
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q955062) (← links)
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems (Q975360) (← links)
- An active set quasi-Newton method with projected search for bound constrained minimization (Q980100) (← links)
- An algorithm for the fast solution of symmetric linear complementarity problems (Q998634) (← links)
- Quasi-Newton acceleration for equality-constrained minimization (Q1001193) (← links)
- Conjugate gradient method for the linear complementarity problem withs-matrix (Q1007676) (← links)
- An affine-scaling interior-point CBB method for box-constrained optimization (Q1013965) (← links)
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization (Q1021258) (← links)
- Numerical treatment of nonlinear MHD Jeffery-Hamel problems using stochastic algorithms (Q1641201) (← links)
- A decomposition method for large-scale box constrained optimization (Q1644498) (← links)
- On the nonmonotonicity degree of nonmonotone line searches (Q1697277) (← links)
- Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization (Q1722397) (← links)
- Prediction-correction method with BB step sizes (Q1731902) (← 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)
- A cyclic projected gradient method (Q1946620) (← links)
- W-methods in optimal control (Q1955640) (← links)
- A dual spectral projected gradient method for log-determinant semidefinite problems (Q1986103) (← links)
- A Morley finite element method for the displacement obstacle problem of clamped Kirchhoff plates (Q2016399) (← links)
- Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization (Q2028460) (← links)
- A convexity enforcing \(C^0\) interior penalty method for the Monge-Ampère equation on convex polygonal domains (Q2049911) (← links)
- Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient (Q2082555) (← links)
- Parallel generalized Lagrange-Newton method for fully coupled solution of PDE-constrained optimization problems with bound-constraints (Q2106215) (← links)
- A decomposition method for Lasso problems with zero-sum constraint (Q2106751) (← links)
- Hybrid limited memory gradient projection methods for box-constrained optimization problems (Q2111472) (← links)
- A reduced proximal-point homotopy method for large-scale non-convex BQP (Q2114822) (← links)
- LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
- Efficient unconstrained black box optimization (Q2146451) (← links)
- Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm (Q2176186) (← links)
