The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
From MaRDI portal
Publication:3280554
Cited in
(only showing first 100 items - show all)- A numerically stable dual method for solving strictly convex quadratic programs
- Partially monotone tensor spline estimation of the joint distribution function with bivariate current status data
- Modifications and implementation of the ellipsoid algorithm for linear programming
- Conditional subgradient optimization -- theory and applications
- Two-phase model algorithm with global convergence for nonlinear programming
- Subdivision shell elements with anisotropic growth
- An approximation-concepts approach to shape optimal design
- Optimizing Frequencies in a Transit Network: a Nonlinear Bi‐level Programming Approach
- 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
- Phase I cycling under the most-obtuse-angle pivot rule
- An example of cycling in a feasible point algorithm
- Approximate methods for convex minimization problems with series-parallel structure
- An optimal linear estimation approach to solve systems of linear algebraic equations
- The steepest descent gravitational method for linear programming
- Recursive interpolation, extrapolation and projection
- A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand
- An exact penalty function based on the projection matrix
- Global convergence of Rosen's gradient projection method
- An active set method for solving linearly constrained nonsmooth optimization problems
- Distance majorization and its applications
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
- An interior-point method for solving box-constrained underdetermined nonlinear systems
- The ``Light Beam Search approach. -- An overview of methodology and applications
- Minmax combinatorial optimization
- On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex
- A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization
- Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems
- Optimal decentralized control of dynamic systems
- Gradient-type methods: a unified perspective in computer science and numerical analysis
- Optimization algorithms and point-to-set-maps
- Decentralized Cooperative Optimization for Multi-criteria Decision Making
- Effect of addendum on contact strength, bending strength and basic performance parameters of a pair of spur gears
- Numerical solution of an inverse problem connected with continuous casting of steel
- Procedures for optimization problems with a mixture of bounds and general linear constraints
- An approximate gradient-type method for nonlinear symmetric equations with convex constraints
- Two-person nonzero-sum games and quadratic programming
- An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems
- Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation
- Scheduling of power generation via large-scale nonlinear optimization
- A finite algorithm to maximize certain pseudoconcave functions on polytopes
- A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix
- Topology optimization of shell structures using adaptive inner-front (AIF) level set method
- User-satisfaction based bandwidth allocation for transmission of multiple sources of human perceptual data
- Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization
- On Rosen's gradient projection methods
- Conjugate gradient-type algorithms for frictional multi-contact problems: applications to granular materials
- A flexible, computationally efficient method for fitting the proportional hazards model to interval-censored data
- Implementation of gradient methods by tangential discretization
- Spline-based sieve maximum likelihood estimation in the partly linear model under monotonicity constraints
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- Interactive solutions for the linear multiobjective transportation problem
- Partitioning procedures for solving mixed-variables programming problems
- A projection gradient method for computing ground state of spin-2 Bose-Einstein condensates
- A convergence theorem of Rosen’s gradient projection method
- A spline-based semiparametric maximum likelihood estimation method for the Cox model with interval censored data
- Inexact-restoration algorithm for constrained optimization
- A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems
- The steepest-ascent method for the linear programming problem
- A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints
- Convex analysis in the semiparametric model with Bernstein polynomials
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- Indefinite cubic programming with standard errors in objective function
- A Gauss-Seidel like algorithm to solve frictional contact problems
- Local convergence of an inexact-restoration method and numerical experiments
- Ein Verfahren zur Lösung parameterabhängiger, nichtlinearer Maximum-Probleme
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- 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
- A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems
- Jointly constrained bilinear programs and related problems: An overview
- The generalized simplex method
- Extension of a hybrid genetic algorithm for nonlinear programming problems with equality and inequality constraints.
- Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems
- A unified algorithm for mixed \(l_{2,p}\)-minimizations and its application in feature selection
- Proximal methods for the latent group lasso penalty
- A flexible inexact-restoration method for constrained optimization
- Multivariate stable distributions
- OPTIMAL CONTROL OF BIOLOGICAL INVASIONS IN LAKE NETWORKS
- Nonnegative matrix factorization of a correlation matrix
- Optimization of stochastic simulation models
- A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization
- Source-oriented adaptive beamforming
- An alternate implementation of Goldfarb's minimization algorithm
- Decentralized optimization for distributed-lag models of discrete systems
- An algorithm for hierarchical optimization of large-scale problems with nested structure
- The genesis and early developments of Aitken's process, Shanks' transformation, the \(\varepsilon\)-algorithm, and related fixed point methods
- Rosen's gradient projection with discrete steps
- Stability and bounds for nonlinear systems of difference and differential equations
- Projection methods for non-linear programming
- Minimization methods with constraints
- Geometric programming for optimal allocation of integrated samples in quality control
- Constrained optimization along geodesics
- Dictionary Learning for L1-Exact Sparse Coding
- A computational study of active set strategies in nonlinear programming with linear constraints
- Direct methods for the solution of linear systems
- A subgradient projection algorithm
- A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization
- Feasible direction method for large-scale nonconvex programs: Decomposition approach
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)