Pages that link to "Item:Q4744873"
From MaRDI portal
The following pages link to Projected Newton Methods for Optimization Problems with Simple Constraints (Q4744873):
Displayed 50 items.
- 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)
- Solving emission tomography problems on vector machines (Q753694) (← links)
- Finite convergence of algorithms for nonlinear programs and variational inequalities (Q809897) (← 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)
- 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)
- An algorithm for the fast solution of symmetric linear complementarity problems (Q998634) (← 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)
- Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
- An active constraints Newton algorithm for the spatial price equilibrium problem (Q1319575) (← links)
- Interior point methods for optimal control of discrete time systems (Q1321328) (← links)
- Two methods for large-scale nonlinear optimization and their comparison on a case study of hydropower optimization (Q1331085) (← links)
- A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem (Q1338146) (← links)
- A note on exploiting structure when using slack variables (Q1340068) (← links)
- Family of projected descent methods for optimization problems with simple bounds (Q1364228) (← links)
- A survey of some mathematical programming models in transportation (Q1367685) (← links)
- A unified approach for parameter identification of inelastic material models in the frame of the finite element method (Q1371809) (← links)
- Parameter identification for finite deformation elasto-plasticity in principal directions (Q1376126) (← links)
- Nonmonotone strategy for minimization of quadratics with simple constraints. (Q1771833) (← links)
- An efficient trust region method for unconstrained discrete-time optimal control problems (Q1804374) (← links)
- Local convergence analysis of projection-type algorithms: unified approach (Q1810933) (← links)
- A class of smoothing functions for nonlinear and mixed complementarity problems (Q1815073) (← links)
- On the convergence of projected gradient processes to singular critical points (Q1821692) (← links)
- An iterative working-set method for large-scale nonconvex quadratic programming (Q1862010) (← links)
- Some recent advances in projection-type methods for variational inequalities (Q1872978) (← links)
- Dynamic traffic assignment: Considerations on some deterministic modelling approaches (Q1908277) (← links)
- An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems (Q1908927) (← links)
- Newton-Goldstein convergence rates for convex constrained minimization problems with singular solutions (Q2266355) (← links)
- Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints (Q2276884) (← links)
- Restricted simplicial decomposition for convex constrained problems (Q2366609) (← links)
- The active-set method for nonnegative regularization of linear ill-posed problems (Q2369196) (← links)
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints (Q2385544) (← links)
- Global convergence of a modified gradient projection method for convex constrained problems (Q2431943) (← links)