Pages that link to "Item:Q4744873"
From MaRDI portal
The following pages link to Projected Newton Methods for Optimization Problems with Simple Constraints (Q4744873):
Displaying 50 items.
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis (Q312468) (← links)
- A family of second-order methods for convex \(\ell _1\)-regularized optimization (Q312690) (← 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)
- Constrained numerical optimization methods for blind deconvolution (Q393752) (← links)
- Distance majorization and its applications (Q403660) (← links)
- An improved Newton projection method for nonnegative deblurring of Poisson-corrupted images with Tikhonov regularization (Q415336) (← links)
- Accelerating the convergence in the single-source and multi-source Weber problems (Q428088) (← links)
- Efficient nonnegative matrix factorization via projected Newton method (Q437490) (← links)
- Proximal methods for the latent group lasso penalty (Q457209) (← links)
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function (Q467409) (← links)
- A symmetric rank-one quasi-Newton method for nonnegative matrix factorization (Q469969) (← links)
- Convergence properties of nonmonotone spectral projected gradient methods (Q557737) (← links)
- A direct active set algorithm for large sparse quadratic programs with simple bounds (Q583116) (← links)
- Column generation algorithms for nonlinear optimization. II: Numerical investigations (Q609805) (← 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)
- Quasi-Newton projection methods and the discrepancy principle in image restoration (Q654689) (← links)
- A quadratic penalty method for hypergraph matching (Q683734) (← links)
- Solving emission tomography problems on vector machines (Q753694) (← 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)
- Finite convergence of algorithms for nonlinear programs and variational inequalities (Q809897) (← links)
- Fast simultaneous angle, wedge, and beam intensity optimization in inverse radiotherapy planning (Q833395) (← links)
- On projected Newton-Krylov solvers for instationary laminar reacting gas flows (Q846598) (← links)
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints (Q853889) (← links)
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q870176) (← links)
- An ODE traffic network model (Q880201) (← links)
- An active-set projected trust region algorithm for box constrained optimization problems (Q905153) (← links)
- On large scale nonlinear network optimization (Q908858) (← links)
- Convergence properties of trust region methods for linear and convex constraints (Q922951) (← links)
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization (Q929334) (← links)
- A projected Newton-CG method for nonnegative astronomical image deblurring (Q937181) (← links)
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q955062) (← links)
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints (Q985699) (← links)
- An algorithm for the fast solution of symmetric linear complementarity problems (Q998634) (← links)
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization (Q1021258) (← links)
- Efficient and modular algorithms in modeling finite inelastic deformations: objective integration, parameter identification and sub-stepping techniques (Q1033486) (← links)
- A class of superlinearly convergent projection algorithms with relaxed stepsizes (Q1057626) (← links)
- Convergent stepsizes for constrained optimization algorithms (Q1061005) (← links)
- Enhanced methods for feasible directions for engineering design problems (Q1068727) (← links)
- Finiteness in restricted simplicial decomposition (Q1069859) (← links)
- A projected Newton method in a Cartesian product of balls (Q1093537) (← links)
- A projected Newton method for minimization problems with nonlinear inequality constraints (Q1095798) (← links)
- Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities (Q1101344) (← links)
- Algorithms for bound constrained quadratic programming problems (Q1122320) (← links)
- Implementing proximal point methods for linear programming (Q1123124) (← links)
- Solving some optimal control problems using the barrier penalty function method (Q1187560) (← links)
- Gauss-Seidel-Newton-Armijo approach for minimization problems on the non- negative orthant. Application to spatial price equilibrium problems (Q1197676) (← links)
- Dynamic programming method for constrained discrete-time optimal control (Q1291816) (← links)
