The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
From MaRDI portal
Publication:3280554
DOI10.1137/0108011zbMATH Open0099.36405OpenAlexW2143101939MaRDI QIDQ3280554FDOQ3280554
Authors: J. B. Rosen
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
Cited In (only showing first 100 items - show all)
- An alternate implementation of Goldfarb's minimization algorithm
- Dictionary Learning for L1-Exact Sparse Coding
- A nonmetric variety of linear factor analysis
- The prerestorative step in the sequential gradient-restoration algorithm for mathematical programming problems with inequality constraints
- Modification of Karmarkar's projective scaling algorithm
- A computational study of active set strategies in nonlinear programming with linear constraints
- Improving feasible directions for a class of nondifferentiable functions
- Decentralized optimization for distributed-lag models of discrete systems
- Properties of the sequential gradient-restoration algorithm (SGRA). I: Introduction and comparison with related methods
- Optimization of stochastic simulation models
- Geometric programming for optimal allocation of integrated samples in quality control
- One-at-a-time dynamic programming over polytope
- A computational method for parameter optimization problems arising in control†
- Algorithms for some minimax problems
- \(\epsilon\)-subgradient projection algorithm
- Optimal packing of material flow on conveyor belts
- Projection methods for non-linear programming
- A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization
- Optimierung in der Stichprobentheorie durch Schichtung und Aufteilung
- Feasible direction method for large-scale nonconvex programs: Decomposition approach
- Minimum Ellipsoids
- Algoritmo risolutivo per una classe particolare di problemi di minimo vincolato
- Minimization methods with constraints
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- An optimization framework of biological dynamical systems
- A class of direct methods for linear systems
- Stable barrier-projection and barrier-Newton methods in linear programming
- Spline-based sieve estimation in monotone constrained varying-coefficient partially linear EV model
- Numerical study of some feasible direction methods in mathematical programming
- Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis
- Minimization of convex functions on the convex hull of a point set
- A conjugate gradient projection method for solving equations with convex constraints
- A general approach to one-step iterative methods with application to eigenvalue problems
- Nonnegative matrix factorization of a correlation matrix
- Stability and bounds for nonlinear systems of difference and differential equations
- A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization
- An algorithm for hierarchical optimization of large-scale problems with nested structure
- Rosen's gradient projection with discrete steps
- Optimization models in the natural gas industry
- Comparison of some methods used for process identification
- Source-oriented adaptive beamforming
- A modified gradient projection method for static and dynamic topology optimization
- On generalized inverses and on the uniform convergence of \((I-\beta K)_ n\) with application to iterative methods
- Finitely convergent \(\varepsilon\)-generalized projection algorithm for nonlinear systems
- A method for solving maximum-problems with a nonconcave quadratic objective function
- A robust superlinearly convergent algorithm for linearly constrained optimization problems under degeneracy
- Optimal control for nonlinear systems calculated with small computers
- Subgradient projection algorithm. II
- Contact problem and numeric method of a planetary drive with small teeth number difference
- The genesis and early developments of Aitken's process, Shanks' transformation, the \(\varepsilon\)-algorithm, and related fixed point methods
- Satisfactory solutions approach to parameter optimization of dynamic systems with vector performance index
- An interior feasible direction method with constraint projections for linear programming
- Numeric computation of the projection of a point onto a polyhedron
- Intelligent gradient search in linear programming
- Condensing generalized polynomials
- Constrained optimization along geodesics
- A subgradient projection algorithm
- Direct methods for the solution of linear systems
- Spline estimation of generalised monotonic regression
- Robust decisions in economic models
- Approximate methods for convex minimization problems with series-parallel structure
- Optimal decentralized control of dynamic systems
- Conjugate gradient-type algorithms for frictional multi-contact problems: applications to granular materials
- On Rosen's gradient projection methods
- An approximation-concepts approach to shape optimal design
- A finite algorithm to maximize certain pseudoconcave functions on polytopes
- A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems
- Subdivision shell elements with anisotropic growth
- A spline-based semiparametric maximum likelihood estimation method for the Cox model with interval censored data
- Modifications and implementation of the ellipsoid algorithm for linear programming
- Numerical solution of an inverse problem connected with continuous casting of steel
- Gradient-type methods: a unified perspective in computer science and numerical analysis
- Effect of addendum on contact strength, bending strength and basic performance parameters of a pair of spur gears
- An exact penalty function based on the projection matrix
- Decentralized Cooperative Optimization for Multi-criteria Decision Making
- Implementation of gradient methods by tangential discretization
- Partitioning procedures for solving mixed-variables programming problems
- A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems
- Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems
- Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation
- A convergence theorem of Rosen’s gradient projection method
- Indefinite cubic programming with standard errors in objective function
- A family of gradient projection methods
- Discussion on the convergence of Rosen's gradient projection method
- Remarks on the convergence of Rosen's gradient projection method
- The steepest descent gravitational method for linear programming
- Recursive interpolation, extrapolation and projection
- Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
- Jointly constrained bilinear programs and related problems: An overview
- Conditional subgradient optimization -- theory and applications
- An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems
- A flexible, computationally efficient method for fitting the proportional hazards model to interval-censored data
- A Gauss-Seidel like algorithm to solve frictional contact problems
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- Multivariate stable distributions
- Optimizing Frequencies in a Transit Network: a Nonlinear Bi‐level Programming Approach
- Global convergence of Rosen's gradient projection method
- A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization
- Ein Verfahren zur Lösung parameterabhängiger, nichtlinearer Maximum-Probleme
- An example of cycling in a feasible point algorithm
This page was built for publication: The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3280554)