Projected gradient methods for linearly constrained problems

From MaRDI portal

Publication:3773706

Jump to:navigation, search

DOI10.1007/BF02592073zbMath0634.90064OpenAlexW2098132613MaRDI QIDQ3773706

Jorge J. Moré, Paul H. Calamai

Publication date: 1987

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02592073

zbMATH Keywords

large scale problems bound constrained problems convergence theory gradient projection method linearly constrained problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52)

Related Items

Newton projection method as applied to assembly simulation, Convergence properties of inexact projected gradient methods, An MCMC method for uncertainty quantification in nonnegativity constrained inverse problems, An additional projection step to He and Liao's method for solving variational inequalities, Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization, Payoff landscapes and the robustness of selfish optimization in iterated games, A convergence analysis result for constrained convex minimization problem, On the convergence of an active-set method for ℓ₁minimization, General fixed-point method for solving the linear complementarity problem, Proximal methods avoid active strict saddles of weakly convex functions, A Family of Supermemory Gradient Projection Methods for Constrained Optimization, LMBOPT: a limited memory method for bound-constrained optimization, On the rate of convergence of projected Barzilai–Borwein methods, Modified descent-projection method for solving variational inequalities, A sequential quadratic programming method for potentially infeasible mathematical programs, Partial Smoothness and Constant Rank, ON A NEW NUMERICAL METHOD FOR SOLVING GENERAL VARIATIONAL INEQUALITIES, New effective projection method for variational inequalities problem, Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search, Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation, Hybrid algorithms with active set prediction for solving linear inequalities in a least squares sense, A smoothing projected HS method for solving stochastic tensor complementarity problem, A relaxed inertial and viscosity method for split feasibility problem and applications to image recovery, A novel projected gradient-like method for optimization problems with simple constraints, A gradient descent method for estimating the Markov chain choice model, Identification of ARMA models with binary-valued observations, On the stationarity for nonlinear optimization problems with polyhedral constraints, Threshold selection and resource allocation for quantized identification, Asymptotic consensus of multi-agent systems under binary-valued observations and observation uncertainty, FAST NON-NEGATIVE LEAST-SQUARES LEARNING IN THE RANDOM NEURAL NETWORK, A self-adaptive projection method with improved step-size for solving variational inequalities, Quasi non-negative quaternion matrix factorization with application to color face recognition, Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming, The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions, 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 posteriori error control for the binary Mumford-Shah model, OPTIMAL TREATMENT PLANNING IN RADIOTHERAPY BASED ON BOLTZMANN TRANSPORT CALCULATIONS, On proximal gradient method for the convex problems regularized with the group reproducing kernel norm, An augmented Lagrangian filter method, A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds, Parameter Selection and Preconditioning for a Graph Form Solver, Lower bounds for ground states of condensed matter systems, On solving simple bilevel programs with a nonconvex lower level program, A Subspace Modified PRP Method for Large-scale Nonlinear Box-Constrained Optimization, Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs, A projection method for a system of nonlinear monotone equations with convex constraints, A practical method for computing the largestM-eigenvalue of a fourth-order partially symmetric tensor, Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms, Iterative methods for constrained convex minimization problem in Hilbert spaces, General iterative scheme based on the regularization for solving a constrained convex minimization problem, Ergodic convergence in subgradient optimization, Global convergence and finite termination of a class of smooth penalty function algorithms, Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems, Tangent projection equations and general variational inequalities, The chain rule for VU-decompositions of nonsmooth functions, Unnamed Item, Projected Gradient Methods for Nonnegative Matrix Factorization, Generic Minimizing Behavior in Semialgebraic Optimization, The Lagrangian globalization method for nonsmooth constrained equations, A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables, Unified framework of extragradient-type methods for pseudomonotone variational inequalities., A Smoothing Projected Levenberg-Marquardt Type Algorithm for Solving Constrained Equations, ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration, An iterative method and weak sharp solutions for multitime-type variational inequalities, A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization, Large‐margin classification with multiple decision rules, Weak sharpness for set-valued variational inequalities and applications to finite termination of iterative algorithms, On the inexact symmetrized globally convergent semi-smooth Newton method for 3D contact problems with Tresca friction: the R-linear convergence rate, Stochastic structured tensors to stochastic complementarity problems, Modulus-Type Inner Outer Iteration Methods for Nonnegative Constrained Least Squares Problems, Distributed recursive projection identification with binary-valued observations, Sparse classification: a scalable discrete optimization perspective, A projection and contraction method for symmetric cone complementarity problem, An improved generalized flexibility matrix approach for structural damage detection, Multilevel selective harmonic modulation via optimal control, On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches, Active‐Set Newton Methods and Partial Smoothness, An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming, Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems, An orthogonal subspace minimization method for finding multiple solutions to the defocusing nonlinear Schrödinger equation with symmetry, Reconstruction algorithm for unknown cavities via Feynman-Kac type formula, Convergence of the Implicit Filtering Method for Constrained Optimization of Noisy Functions, A projection descent method for solving variational inequalities, A modified spectral conjugate gradient projection algorithm for total variation image restoration, An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations, The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction, Hybrid limited memory gradient projection methods for box-constrained optimization problems, Globalization technique for projected Newton–Krylov methods, Some recent advances in projection-type methods for variational inequalities, A modified augmented Lagrangian method for a class of monotone variational inequalities, New properties of forward-backward splitting and a practical proximal-descent algorithm, Optimality conditions in variational form for non-linear constrained stochastic control problems, A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems, A superlinearly convergent projection method for constrained systems of nonlinear equations, Single-projection procedure for linear optimization, A class of iterative methods for solving nonlinear projection equations, An active set algorithm for nonlinear optimization with polyhedral constraints, Family of projected descent methods for optimization problems with simple bounds, Multicriteria approach to bilevel optimization, A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization, Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization, Smoothing nonmonotone Barzilai-Borwein gradient method and its application to stochastic linear complementarity problems, Algorithms for bound constrained quadratic programming problems, Strong convergence of a hybrid projection iterative algorithm for common solutions of operator equations and of inclusion problems, Implementing proximal point methods for linear programming, An algorithm for local continuous optimization of traffic signals, A cone constrained convex program: structure and algorithms, Projection methods of iterative solutions in Hilbert spaces, Weak sharp solutions for generalized variational inequalities, On finite convergence of iterative methods for variational inequalities in Hilbert spaces, A regularized gradient projection method for the minimization problem, Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization, Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints, A multivariate spectral projected gradient method for bound constrained optimization, New step lengths in projection method for variational inequality problems, An active-set projected trust region algorithm for box constrained optimization problems, Linear convergence analysis of the use of gradient projection methods on total variation problems, Adjoint IMEX-based schemes for control problems governed by hyperbolic conservation laws, An active set limited memory BFGS algorithm for bound constrained optimization, Stopping rules and backward error analysis for bound-constrained optimization, Averaged mappings and the gradient-projection algorithm, Strong convergence of a projected gradient method, Separable spherical constraints and the decrease of a quadratic function in the gradient projection step, Variant gradient projection methods for the minimization problems, Event-triggered identification of FIR systems with binary-valued output observations, Error bounds and finite termination for constrained optimization problems, Approximation of zeros of inverse strongly monotone operators in Banach spaces, Convergence properties of trust region methods for linear and convex constraints, Optimality, identifiability, and sensitivity, Decomposition method for a class of monotone variational inequality problems, An operator splitting algorithm for Tikhonov-regularized topology optimization, A projected gradient trust-region method for solving nonlinear systems with convex constraints, Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem, On solving of constrained convex minimize problem using gradient projection method, An Eulerian-Lagrangian method for optimization problems governed by multidimensional nonlinear hyperbolic PDEs, A new approximation of the matrix rank function and its application to matrix rank minimization, Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization, Finite convergence of the proximal point algorithm for variational inequality problems, Finite termination of inexact proximal point algorithms in Hilbert spaces, Cross-Hill: a heuristic method for global optimization, Solution of projection problems over polytopes, Information-based parameterization of the log-linear model for categorical data analysis, Approximation of solutions to constrained convex minimization problem in Hilbert spaces, Identification of the blood perfusion rate for laser-induced thermotherapy in the liver, A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming, A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization, A nonmonotone trust-region method for generalized Nash equilibrium and related problems with strong convergence properties, A node-to-node scheme for three-dimensional contact problems using the scaled boundary finite element method, On image reconstruction algorithms for binary electromagnetic geotomography, A quadratic penalty method for hypergraph matching, Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization, Minimum principle sufficiency, Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness, A projection-filter method for solving nonlinear complementarity problems, A hybrid gradient-projection algorithm for averaged mappings in Hilbert spaces, Solving variational inequality and fixed point problems by line searches and potential optimization, Active-set projected trust-region algorithm for box-constrained nonsmooth equations, A dual gradient-projection method for large-scale strictly convex quadratic problems, Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming, Convergence properties of nonmonotone spectral projected gradient methods, A general iterative scheme based on regularization for solving equilibrium and constrained convex minimization problems, Modified projection method for solving a system of monotone equations with convex constraints, A sequential homotopy method for mathematical programming problems, Projected gradient method for kernel discriminant nonnegative matrix factorization and the applications, Attributed graph clustering with subspace stochastic block model, A direct active set algorithm for large sparse quadratic programs with simple bounds, Convergence of a projected gradient method variant for quasiconvex objectives, A study on distributed optimization over large-scale networked systems, A smoothing projected Newton-type algorithm for semi-infinite programming, A numerical algorithm for hydrodynamic free boundary problems, On finite convergence and constraint identification of subgradient projection methods, A smoothing augmented Lagrangian method for solving simple bilevel programs, Z-eigenvalue methods for a global polynomial optimization problem, Local convergence analysis of projection-type algorithms: unified approach, Solving emission tomography problems on vector machines, Two error bounds for constrained optimization problems and their applications, A unified identification algorithm of FIR systems based on binary observations with time-varying thresholds, Modified extragradient methods for solving variational inequalities, A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems, A robust sequential quadratic programming method, Impulse noise removal by an adaptive trust-region method, Energy efficiency optimization algorithm of CR-NOMA system based on SWIPT, Solving box constrained variational inequalities by using the natural residual with D-gap function globalization, Selected bibliography on degeneracy, An iterative working-set method for large-scale nonconvex quadratic programming, Finite convergence of algorithms for nonlinear programs and variational inequalities, A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations, On solutions of sparsity constrained optimization

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3773706&oldid=17324680"