The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
From MaRDI portal
Publication:3280554
DOI10.1137/0108011zbMath0099.36405OpenAlexW2143101939MaRDI QIDQ3280554
Publication date: 1960
Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0108011
Related Items
A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems ⋮ An exact penalty function based on the projection matrix ⋮ A feasible descent cone method for linearly constrained minimization problems ⋮ Interactive solutions for the linear multiobjective transportation problem ⋮ Stable barrier-projection and barrier-Newton methods in linear programming ⋮ A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand ⋮ Maximin efficiency-robust tests and some extensions ⋮ Improving feasible directions for a class of nondifferentiable functions ⋮ Partial spectral projected gradient method with active-set strategy for linearly constrained optimization ⋮ Local convergence of an inexact-restoration method and numerical experiments ⋮ A new generalized gradient projection type algorithm for linearly constrained problems ⋮ Properties of the sequential gradient-restoration algorithm (SGRA). I: Introduction and comparison with related methods ⋮ Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis ⋮ Projection gradient method for energy functional minimization with a constraint and its application to computing the ground state of spin-orbit-coupled Bose-Einstein condensates ⋮ \(\epsilon\)-subgradient projection algorithm ⋮ A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix ⋮ Two-stage strategy for simultaneous slewing and vibration suppression of flexible structures ⋮ Topology optimization of shell structures using adaptive inner-front (AIF) level set method ⋮ Spline-based sieve maximum likelihood estimation in the partly linear model under monotonicity constraints ⋮ User-satisfaction based bandwidth allocation for transmission of multiple sources of human perceptual data ⋮ A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization ⋮ Minmax combinatorial optimization ⋮ Finitely convergent \(\varepsilon\)-generalized projection algorithm for nonlinear systems ⋮ Partitioning procedures for solving mixed-variables programming problems ⋮ Two-phase model algorithm with global convergence for nonlinear programming ⋮ Distance majorization and its applications ⋮ Spline-based sieve estimation in monotone constrained varying-coefficient partially linear EV model ⋮ Feasible direction method for large-scale nonconvex programs: Decomposition approach ⋮ Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization ⋮ Gradient-type methods: a unified perspective in computer science and numerical analysis ⋮ Optimization of stochastic simulation models ⋮ Algoritmo risolutivo per una classe particolare di problemi di minimo vincolato ⋮ Fast projections onto mixed-norm balls with applications ⋮ A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems ⋮ Constrained optimization along geodesics ⋮ The genesis and early developments of Aitken's process, Shanks' transformation, the \(\varepsilon\)-algorithm, and related fixed point methods ⋮ On Rosen's gradient projection methods ⋮ A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization ⋮ A subgradient projection algorithm ⋮ Jointly constrained bilinear programs and related problems: An overview ⋮ Numerical study of some feasible direction methods in mathematical programming ⋮ Proximal methods for the latent group lasso penalty ⋮ A unified algorithm for mixed \(l_{2,p}\)-minimizations and its application in feature selection ⋮ Rosen's gradient projection with discrete steps ⋮ Optimal decentralized control of dynamic systems ⋮ Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems ⋮ A Gauss-Seidel like algorithm to solve frictional contact problems ⋮ Contact problem and numeric method of a planetary drive with small teeth number difference ⋮ Inexact-restoration algorithm for constrained optimization ⋮ On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization ⋮ Vertex assigned morphing for parameter free shape optimization of 3-dimensional solid structures ⋮ The generalized simplex method ⋮ A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints ⋮ Effect of addendum on contact strength, bending strength and basic performance parameters of a pair of spur gears ⋮ Generalized bilinear programming. I: Models, applications and linear programming relaxation ⋮ An interactive multi-objective gradient search ⋮ A numerically stable dual method for solving strictly convex quadratic programs ⋮ Modification of Karmarkar's projective scaling algorithm ⋮ An interior-point method for solving box-constrained underdetermined nonlinear systems ⋮ A nonmetric variety of linear factor analysis ⋮ Decentralized optimization for distributed-lag models of discrete systems ⋮ One-at-a-time dynamic programming over polytope ⋮ Chebyshev approximation by H-polynomials: A numerical method ⋮ A family of gradient projection methods ⋮ Remarks on the convergence of Rosen's gradient projection method ⋮ Discussion on the convergence of Rosen's gradient projection method ⋮ Minimization methods with constraints ⋮ The steepest descent gravitational method for linear programming ⋮ Recursive interpolation, extrapolation and projection ⋮ Optimal packing of material flow on conveyor belts ⋮ The prerestorative step in the sequential gradient-restoration algorithm for mathematical programming problems with inequality constraints ⋮ On the optimization of constrained functions: Comparison of sequential gradient-restoration algorithm and gradient-projection algorithm ⋮ Partially monotone tensor spline estimation of the joint distribution function with bivariate current status data ⋮ A projection gradient method for computing ground state of spin-2 Bose-Einstein condensates ⋮ An optimization framework of biological dynamical systems ⋮ Implementation of gradient methods by tangential discretization ⋮ The ``Light Beam Search approach. -- An overview of methodology and applications ⋮ An optimal linear estimation approach to solve systems of linear algebraic equations ⋮ Conditional subgradient optimization -- theory and applications ⋮ A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties ⋮ Deriving Karmarkar's LP algorithm using angular projection matrix ⋮ Nonnegative matrix factorization of a correlation matrix ⋮ Scheduling of power generation via large-scale nonlinear optimization ⋮ Global convergence of Rosen's gradient projection method ⋮ Stability and bounds for nonlinear systems of difference and differential equations ⋮ Nonwastefulness of interior iterative procedures ⋮ A robust superlinearly convergent algorithm for linearly constrained optimization problems under degeneracy ⋮ A class of direct methods for linear systems ⋮ Numeric computation of the projection of a point onto a polyhedron ⋮ Source-oriented adaptive beamforming ⋮ An approximation-concepts approach to shape optimal design ⋮ Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions ⋮ Optimal control for nonlinear systems calculated with small computers ⋮ Subgradient projection algorithm. II ⋮ A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\) ⋮ Multiperiod production planning with demand and cost fluctuation ⋮ Satisfactory solutions approach to parameter optimization of dynamic systems with vector performance index ⋮ Direct methods for the solution of linear systems ⋮ An interior feasible direction method with constraint projections for linear programming ⋮ Intelligent gradient search in linear programming ⋮ On computation of semiparametric maximum likelihood estimators with shape constraints ⋮ Improving of the identification algorithm for a quasilinear recurrence equation ⋮ An approximate gradient-type method for nonlinear symmetric equations with convex constraints ⋮ Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming. ⋮ On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex ⋮ Indefinite cubic programming with standard errors in objective function ⋮ Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications ⋮ Newton projection method as applied to assembly simulation ⋮ A counterexample of the convergence of Rosen's algorithm with inexact line search ⋮ Numerical solution of an inverse problem connected with continuous casting of steel ⋮ Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation ⋮ Solution Of Bounded Nonlinear Systems Of Equations Using Homotopies With Inexact Restoration ⋮ Modulus Methods for Nonnegatively Constrained Image Restoration ⋮ A modified gradient projection method for static and dynamic topology optimization ⋮ A computational method for optimal control of a linear system by quadratic programming† ⋮ Two-person nonzero-sum games and quadratic programming ⋮ A new method for solving conditioned maxima problems ⋮ Projected gradient algorithms for optimization over order simplices ⋮ Identification of point sets by quasidifferentiable functions ⋮ A novel projected Fletcher‐Reeves conjugate gradient approach for finite‐time optimal robust controller of linear constraints optimization problem: Application to bipedal walking robots ⋮ LINEAR POLICY MODELS AND QUADRATIC OPTIMIZATION* ⋮ Optimal allocation of stratified samples with several variance constraints and equal workloads over time by geometric programming ⋮ Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems ⋮ Numerical minimization methods for convex functionals dependent on probability measures with applications to optimal pollution monitoring ⋮ Test shape constraints in semiparametric model with Bernstein polynomials ⋮ Mixed strain/stress gradient loadings for FFT-based computational homogenization methods ⋮ A computational method for parameter optimization problems arising in control† ⋮ Subdivision shell elements with anisotropic growth ⋮ The geodesic dynamic relaxation method for problems of equilibrium with equality constraint conditions ⋮ Optimierung in der Stichprobentheorie durch Schichtung und Aufteilung ⋮ The multiproximal linearization method for convex composite problems ⋮ The projection operator applied to gradient methods for solving optimal control problems with terminal state constraints ⋮ Minimization of convex functions on the convex hull of a point set ⋮ A projective method for structured nonlinear programs ⋮ An active set method for solving linearly constrained nonsmooth optimization problems ⋮ On the application of deterministic and stochastic programming methods to problems of economics;Mathematische Programmierung und ihre Anwendung auf die Wirtschaft ⋮ Optimization Models in the Natural Gas Industry ⋮ An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems ⋮ Projection methods for non-linear programming ⋮ Geometric programming for optimal allocation of integrated samples in quality control ⋮ An alternate implementation of Goldfarb's minimization algorithm ⋮ Optimization algorithms and point-to-set-maps ⋮ Unnamed Item ⋮ Optimizing Frequencies in a Transit Network: a Nonlinear Bi‐level Programming Approach ⋮ Über Optimalisierungsprobleme aus dem Bereich der Statik II ⋮ PARAMETRIC IDENTIFICATION OF QUASILINEAR DIFFERENCE EQUATION ⋮ A finite algorithm to maximize certain pseudoconcave functions on polytopes ⋮ A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization ⋮ Convergence bounds for nonlinear programming algorithms ⋮ Unnamed Item ⋮ On using equality-constraint algorithms for inequality constrained problems ⋮ Decentralized Cooperative Optimization for Multi-criteria Decision Making ⋮ Unnamed Item ⋮ A negative-positive barrier method for non-linear programming ⋮ Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT) ⋮ Approximate methods for convex minimization problems with series-parallel structure ⋮ An algorithm for constructing minimal-order observers for linear functions of the state ⋮ A convergence theorem of Rosen’s gradient projection method ⋮ Phase I cycling under the most-obtuse-angle pivot rule ⋮ Ein Verfahren zur Lösung parameterabhängiger, nichtlinearer Maximum-Probleme ⋮ Conjugate gradient-type algorithms for frictional multi-contact problems: applications to granular materials ⋮ Mathematical programming applied to linear approximation of functions ⋮ A proximal subgradient projection algorithm for linearly constrained strictly convex problems ⋮ Robust decisions in economic models ⋮ Extension of a hybrid genetic algorithm for nonlinear programming problems with equality and inequality constraints. ⋮ Parameter space optimization towards integrated mechatronic design for uncertain systems with generalized feedback constraints ⋮ A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models ⋮ Dictionary Learning for L1-Exact Sparse Coding ⋮ Convex analysis in the semiparametric model with Bernstein polynomials ⋮ OPTIMAL CONTROL OF BIOLOGICAL INVASIONS IN LAKE NETWORKS ⋮ A flexible, computationally efficient method for fitting the proportional hazards model to interval-censored data ⋮ A Spline-Based Semiparametric Maximum Likelihood Estimation Method for the Cox Model with Interval-Censored Data ⋮ Solution theorems in probabilistic programming: A linear programming approach ⋮ A note on quasi convex programming ⋮ Comparison of some methods used for process identification ⋮ A computational study of active set strategies in nonlinear programming with linear constraints ⋮ Algorithms for some minimax problems ⋮ A decomposition method for structured linear and nonlinear programs ⋮ Nonlinear programming: Global use of the Lagrangian ⋮ On generalized inverses and on the uniform convergence of \((I-\beta K)_ n\) with application to iterative methods ⋮ Nonlinear programming: A quadratic analysis of ridge paralysis ⋮ A conjugate gradient projection method for solving equations with convex constraints ⋮ Minimum Ellipsoids ⋮ Numerical computational methods of optimisation in control ⋮ Condensing generalized polynomials ⋮ Condensing generalized polynomials ⋮ Indefinite quadratic fractional functional programming ⋮ An optimization approach for the localization of defects in an inhomogeneous medium from acoustic far-field measurements at a fixed frequency ⋮ An example of cycling in a feasible point algorithm ⋮ Convex optimization with an interpolation-based projection and its application to deep learning ⋮ Multivariate stable distributions ⋮ Optimale Aufteilung des Stichprobenumfangs bei mehreren Merkmalen ⋮ A general approach to one-step iterative methods with application to eigenvalue problems ⋮ The steepest-ascent method for the linear programming problem ⋮ An algorithm for hierarchical optimization of large-scale problems with nested structure ⋮ Modifications and implementation of the ellipsoid algorithm for linear programming ⋮ Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks ⋮ A method for solving maximum-problems with a nonconcave quadratic objective function ⋮ Spline estimation of generalised monotonic regression ⋮ Procedures for optimization problems with a mixture of bounds and general linear constraints ⋮ Combining Multi-class SVMs with Linear Ensemble Methods that Estimate the Class Posterior Probabilities ⋮ A flexible inexact-restoration method for constrained optimization ⋮ Zum heutigen Stand der nichtlinearen Optimierungstheorie ⋮ A reduced proximal-point homotopy method for large-scale non-convex BQP ⋮ Stochastic optimization on social networks with application to service pricing
