Projected Newton Methods for Optimization Problems with Simple Constraints
From MaRDI portal
Publication:4744873
DOI10.1137/0320018zbMath0507.49018MaRDI QIDQ4744873
Publication date: 1982
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0320018
65K05: Numerical mathematical programming methods
49M15: Newton-type methods
49M37: Numerical methods based on nonlinear programming
Related Items
Convergence of a projected gradient method with trust region for nonlinear constrained optimization†, A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier, Unnamed Item, Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis, Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems, Parameter estimation for a viscoplastic damage model using a gradient‐based optimization algorithm, Simplicial Decomposition for Convex Generalized Networks, A Family of Supermemory Gradient Projection Methods for Constrained Optimization, Convergence properties of nonmonotone spectral projected gradient methods, A direct active set algorithm for large sparse quadratic programs with simple bounds, Solving emission tomography problems on vector machines, Finite convergence of algorithms for nonlinear programs and variational inequalities, On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints, A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization, An ODE traffic network model, On large scale nonlinear network optimization, Convergence properties of trust region methods for linear and convex constraints, An active set limited memory BFGS algorithm for large-scale bound constrained optimization, A projected Newton-CG method for nonnegative astronomical image deblurring, Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization, An algorithm for the fast solution of symmetric linear complementarity problems, A class of superlinearly convergent projection algorithms with relaxed stepsizes, Convergent stepsizes for constrained optimization algorithms, Enhanced methods for feasible directions for engineering design problems, Finiteness in restricted simplicial decomposition, A projected Newton method in a Cartesian product of balls, A projected Newton method for minimization problems with nonlinear inequality constraints, Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities, Algorithms for bound constrained quadratic programming problems, Implementing proximal point methods for linear programming, Solving some optimal control problems using the barrier penalty function method, Gauss-Seidel-Newton-Armijo approach for minimization problems on the non- negative orthant. Application to spatial price equilibrium problems, Dynamic programming method for constrained discrete-time optimal control, Error bounds and convergence analysis of feasible descent methods: A general approach, An active constraints Newton algorithm for the spatial price equilibrium problem, Interior point methods for optimal control of discrete time systems, Two methods for large-scale nonlinear optimization and their comparison on a case study of hydropower optimization, A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem, A note on exploiting structure when using slack variables, Family of projected descent methods for optimization problems with simple bounds, A survey of some mathematical programming models in transportation, A unified approach for parameter identification of inelastic material models in the frame of the finite element method, Parameter identification for finite deformation elasto-plasticity in principal directions, Nonmonotone strategy for minimization of quadratics with simple constraints., An efficient trust region method for unconstrained discrete-time optimal control problems, Local convergence analysis of projection-type algorithms: unified approach, A class of smoothing functions for nonlinear and mixed complementarity problems, On the convergence of projected gradient processes to singular critical points, An iterative working-set method for large-scale nonconvex quadratic programming, Some recent advances in projection-type methods for variational inequalities, Dynamic traffic assignment: Considerations on some deterministic modelling approaches, An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems, Newton-Goldstein convergence rates for convex constrained minimization problems with singular solutions, Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints, Restricted simplicial decomposition for convex constrained problems, The active-set method for nonnegative regularization of linear ill-posed problems, An interior-point affine-scaling trust-region method for semismooth equations with box constraints, Global convergence of a modified gradient projection method for convex constrained problems, Minimization of convex functions on the convex hull of a point set, A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems, A finite element algorithm for parameter identification of material models for fluid saturated porous media, On convergence of a receding horizon method for parabolic boundary control, An equivalence between two algorithms for a class of quadratic programming problems withmmatrices*, A differentiable exact penalty function for bound constrained quadratic programming problems, The complexity of anl p method for discrete Tchebycheff approximation in exact arithmetic, The method of successive affine reduction for nonlinear minimization, Projected gradient methods for linearly constrained problems, Minimization methods for functions on simple sets, On a lagrange — Newton method for a nonlinear parabolic boundary control problem∗
