Projected Newton Methods for Optimization Problems with Simple Constraints
From MaRDI portal
Publication:4744873
DOI10.1137/0320018zbMath0507.49018OpenAlexW2162988958MaRDI 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
Numerical mathematical programming methods (65K05) Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37)
Related Items
A trust region method with project step for bound constrained optimization without compact condition, A two-stage active-set algorithm for bound-constrained optimization, Linear programming with nonparametric penalty programs and iterated thresholding, On convergence of a receding horizon method for parabolic boundary control, Newton projection method as applied to assembly simulation, Restricted simplicial decomposition for convex constrained problems, The active-set method for nonnegative regularization of linear ill-posed problems, An MCMC method for uncertainty quantification in nonnegativity constrained inverse problems, A Solver for Nonconvex Bound-Constrained Quadratic Optimization, A Family of Supermemory Gradient Projection Methods for Constrained Optimization, Newton-based optimization for Kullback–Leibler nonnegative tensor factorizations, A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems, Structured Sparsity: Discrete and Convex Approaches, An interior-point affine-scaling trust-region method for semismooth equations with box constraints, Total variation-penalized Poisson likelihood estimation for ill-posed problems, A primal-dual active-set algorithm for bilaterally constrained total variation deblurring and piecewise constant Mumford-Shah segmentation problems, Unnamed Item, Semismooth Newton methods with a shooting-like technique for solving a constrained free-boundary HJB equation, Runge-Kutta-like scaling techniques for first-order methods in convex optimization, On consistency of the monotone NPMLE of survival function under the mixed case interval-censored model with left truncation, A quasi-Newton-based floorplanner for fixed-outline floorplanning, The method of successive affine reduction for nonlinear minimization, Asymmetric linear double autoregression, An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints, An adaptive stochastic sequential quadratic programming with differentiable exact augmented Lagrangians, Incorporating multiple a priori information for inverse problem by inexact scaled gradient projection, New insights and augmented Lagrangian algorithm for optimal portfolio liquidation with market impact, A projected Newton algorithm for the dual convex program of elastoplasticity, An almost cyclic 2-coordinate descent method for singly linearly constrained problems, Truncated nonsmooth Newton multigrid for phase-field brittle-fracture problems, with analysis, Parameter-identification of macroscopic material models based on virtual testing of given material mesostructures, A unified analysis of convex and non-convex \(\ell_p\)-ball projection problems, Decomposition method for solving the quadratic programming problem in the aircraft assembly modeling, Portfolio Optimization for Credit-Risky Assets under Marshall–Olkin Dependence, Projected gradient methods for linearly constrained problems, Combined Newton-gradient method for constrained root-finding in chemical reaction networks, 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, The relative formulation of the quadratic programming problem in the aircraft assembly modeling, A stochastic gradient descent algorithm to maximize power utility of large credit portfolios under Marshall-Olkin dependence, Global convergence of a modified gradient projection method for convex constrained problems, Minimization of convex functions on the convex hull of a point set, Minimization methods for functions on simple sets, An automatic \(L_1\)-based regularization method for the analysis of FFC dispersion profiles with quadrupolar peaks, Active Set Complexity of the Away-Step Frank--Wolfe Algorithm, Unnamed Item, Heuristic discrepancy principle for variational regularization of inverse problems, A finite element algorithm for parameter identification of material models for fluid saturated porous media, Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints, A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization, Preconditioning for partial differential equation constrained optimization with control constraints, PNKH-B: A Projected Newton--Krylov Method for Large-Scale Bound-Constrained Optimization, On a lagrange — Newton method for a nonlinear parabolic boundary control problem∗, Newton projection with proportioning using iterative linear algebra for model predictive control with long prediction horizon, An equivalence between two algorithms for a class of quadratic programming problems withmmatrices*, A differentiable exact penalty function for bound constrained quadratic programming problems, Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis, Bounded perturbation resilience of projected scaled gradient methods, Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems, Parameter estimation for a viscoplastic damage model using a gradient‐based optimization algorithm, Modular proximal optimization for multidimensional total-variation regularization, Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization, Fast Projection‐Based Methods for the Least Squares Nonnegative Matrix Approximation Problem, Simplicial Decomposition for Convex Generalized Networks, A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming, Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods, First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants, Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves, An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection, AN ADAPTIVE GRADIENT ALGORITHM FOR LARGE-SCALE NONLINEAR BOUND CONSTRAINED OPTIMIZATION, Scaling techniques for gradient projection-type methods in astronomical image deblurring, Projection-free parallel quadratic programming for linear model predictive control, The complexity of anl p method for discrete Tchebycheff approximation in exact arithmetic, A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring, Some recent advances in projection-type methods for variational inequalities, 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, Fast simultaneous angle, wedge, and beam intensity optimization in inverse radiotherapy planning, A note on exploiting structure when using slack variables, Recent advances in quadratic programming algorithms for nonlinear model predictive control, A projected Newton method in a Cartesian product of balls, A projected Newton method for minimization problems with nonlinear inequality constraints, Projection algorithms for nonconvex minimization with application to sparse principal component analysis, A family of second-order methods for convex \(\ell _1\)-regularized optimization, On projected Newton-Krylov solvers for instationary laminar reacting gas flows, An active set quasi-Newton method with projection step for monotone nonlinear equations, An active set truncated Newton method for large-scale bound constrained optimization, LMBOPT: a limited memory method for bound-constrained optimization, Projected affine-scaling interior-point Newton's method with line search filter for box constrained optimization, Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities, On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints, An active set algorithm for nonlinear optimization with polyhedral constraints, Family of projected descent methods for optimization problems with simple bounds, 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, A survey of some mathematical programming models in transportation, \(l_1\) regularized multiplicative iterative path algorithm for non-negative generalized linear models, A unified approach for parameter identification of inelastic material models in the frame of the finite element method, A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization, A closer look at consistent operator splitting and its extensions for topology optimization, Parameter identification for finite deformation elasto-plasticity in principal directions, Algorithms for bound constrained quadratic programming problems, Implementing proximal point methods for linear programming, An ODE traffic network model, Column generation algorithms for nonlinear optimization. II: Numerical investigations, An active set feasible method for large-scale minimization problems with bound constraints, Constrained numerical optimization methods for blind deconvolution, Distance majorization and its applications, A novel projected gradient-like method for optimization problems with simple constraints, A variational formulation for fuzzy analysis in continuum mechanics, An improved Newton projection method for nonnegative deblurring of Poisson-corrupted images with Tikhonov regularization, NPtool: a MATLAB software for nonnegative image restoration with Newton projection methods, An active-set projected trust region algorithm for box constrained optimization problems, Accelerating the convergence in the single-source and multi-source Weber problems, Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints, Optimal selection of the regularization function in a weighted total variation model. II: Algorithm, its analysis and numerical tests, On large scale nonlinear network optimization, Efficient nonnegative matrix factorization via projected Newton method, An active set limited memory BFGS algorithm for bound constrained optimization, Proximal methods for the latent group lasso penalty, Convergence properties of trust region methods for linear and convex constraints, Scaled projected-directions methods with application to transmission tomography, Convex optimization techniques in compliant assembly simulation, Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization, A feasible direction method for the semidefinite program with box constraints, Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function, Quasi-Newton projection methods and the discrepancy principle in image restoration, A symmetric rank-one quasi-Newton method for nonnegative matrix factorization, An active set limited memory BFGS algorithm for large-scale bound constrained optimization, A projected Newton-CG method for nonnegative astronomical image deblurring, Solving some optimal control problems using the barrier penalty function method, A quadratic penalty method for hypergraph matching, Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization, Gauss-Seidel-Newton-Armijo approach for minimization problems on the non- negative orthant. Application to spatial price equilibrium problems, Globally convergent DC trust-region methods, Newton-Goldstein convergence rates for convex constrained minimization problems with singular solutions, Convergence properties of nonmonotone spectral projected gradient methods, Nonmonotone strategy for minimization of quadratics with simple constraints., A sequential homotopy method for mathematical programming problems, Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints, A projected semismooth Newton method for problems of calibrating least squares covariance matrix, Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints, A direct active set algorithm for large sparse quadratic programs with simple bounds, 2DNMR data inversion using locally adapted multi-penalty regularization, Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization, An algorithm for the fast solution of symmetric linear complementarity problems, A polynomial chaos expanded hybrid fuzzy-stochastic model for transversely fiber reinforced plastics, An efficient trust region method for unconstrained discrete-time optimal control problems, Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing, Local convergence analysis of projection-type algorithms: unified approach, Solving emission tomography problems on vector machines, Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization, A class of smoothing functions for nonlinear and mixed complementarity problems, On the convergence of projected gradient processes to singular critical points, Consistent finite-dimensional approximation of phase-field models of fracture, Efficient and modular algorithms in modeling finite inelastic deformations: objective integration, parameter identification and sub-stepping techniques, Sparse classification: a scalable discrete optimization perspective, Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem, Impulse noise removal by an adaptive trust-region method, Dynamic programming method for constrained discrete-time optimal control, Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient, An active-set algorithmic framework for non-convex optimization problems over the simplex, A class of superlinearly convergent projection algorithms with relaxed stepsizes, Convergent stepsizes for constrained optimization algorithms, Error bounds and convergence analysis of feasible descent methods: A general approach, An iterative working-set method for large-scale nonconvex quadratic programming, Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates, Enhanced methods for feasible directions for engineering design problems, Finite convergence of algorithms for nonlinear programs and variational inequalities, SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering, Finiteness in restricted simplicial decomposition, An active constraints Newton algorithm for the spatial price equilibrium problem, Interior point methods for optimal control of discrete time systems, A reduced proximal-point homotopy method for large-scale non-convex BQP
