The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Nonnegative matrix factorization of a correlation matrix
- Numeric computation of the projection of a point onto a polyhedron
- Source-oriented adaptive beamforming
- An approximation-concepts approach to shape optimal design
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- Direct methods for the solution of linear systems
- Intelligent gradient search in linear programming
- Interactive solutions for the linear multiobjective transportation problem
- Improving feasible directions for a class of nondifferentiable functions
- 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
- \(\epsilon\)-subgradient projection algorithm
- Minmax combinatorial optimization
- Partitioning procedures for solving mixed-variables programming problems
- Feasible direction method for large-scale nonconvex programs: Decomposition approach
- Optimization of stochastic simulation models
- Algoritmo risolutivo per una classe particolare di problemi di minimo vincolato
- Constrained optimization along geodesics
- A subgradient projection algorithm
- Numerical study of some feasible direction methods in mathematical programming
- Optimal decentralized control of dynamic systems
- The generalized simplex method
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- An interactive multi-objective gradient search
- 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
- Minimization methods with constraints
- 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
- Implementation of gradient methods by tangential discretization
- Conditional subgradient optimization -- theory and applications
- A robust superlinearly convergent algorithm for linearly constrained optimization problems under degeneracy
- A feasible descent cone method for linearly constrained minimization problems
- Stable barrier-projection and barrier-Newton methods in linear programming
- A new generalized gradient projection type algorithm for linearly constrained problems
- Two-stage strategy for simultaneous slewing and vibration suppression of flexible structures
- Two-phase model algorithm with global convergence for nonlinear programming
- Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions
- Multiperiod production planning with demand and cost fluctuation
- A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand
- The genesis and early developments of Aitken's process, Shanks' transformation, the \(\varepsilon\)-algorithm, and related fixed point methods
- Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems
- An interior-point method for solving box-constrained underdetermined nonlinear systems
- An optimization framework of biological dynamical systems
- The ``Light Beam Search approach. -- An overview of methodology 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
- Scheduling of power generation via large-scale nonlinear optimization
- Global convergence of Rosen's gradient projection method
- Nonwastefulness of interior iterative procedures
- Maximin efficiency-robust tests and some extensions
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- Fast projections onto mixed-norm balls with applications
- A Gauss-Seidel like algorithm to solve frictional contact problems
- Inexact-restoration algorithm for constrained optimization
- Vertex assigned morphing for parameter free shape optimization of 3-dimensional solid structures
- Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT)
- A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models
- Convex optimization with an interpolation-based projection and its application to deep learning
- A reduced proximal-point homotopy method for large-scale non-convex BQP
- Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications
- Mixed strain/stress gradient loadings for FFT-based computational homogenization methods
- The multiproximal linearization method for convex composite problems
- Robust decisions in economic models
- Parameter space optimization towards integrated mechatronic design for uncertain systems with generalized feedback constraints
- A conjugate gradient projection method for solving equations with convex constraints
- A flexible inexact-restoration method for constrained optimization
- Stochastic optimization on social networks with application to service pricing
- A counterexample of the convergence of Rosen's algorithm with inexact line search
- Two-person nonzero-sum games and quadratic programming
- A new method for solving conditioned maxima problems
- Minimization of convex functions on the convex hull of a point set
- An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems
- A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization
- Approximate methods for convex minimization problems with series-parallel structure
- Phase I cycling under the most-obtuse-angle pivot rule
- Conjugate gradient-type algorithms for frictional multi-contact problems: applications to granular materials
- Convex analysis in the semiparametric model with Bernstein polynomials
- Solution theorems in probabilistic programming: A linear programming approach
- A note on quasi convex programming
- Comparison of some methods used for process identification
- 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
- Numerical computational methods of optimisation in control
- Indefinite quadratic fractional functional programming
- Multivariate stable distributions
- Optimale Aufteilung des Stichprobenumfangs bei mehreren Merkmalen
- A general approach to one-step iterative methods with application to eigenvalue problems
- Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems
- 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 flexible, computationally efficient method for fitting the proportional hazards model to interval-censored data
- An optimization approach for the localization of defects in an inhomogeneous medium from acoustic far-field measurements at a fixed frequency
- Combining multi-class SVMs with linear ensemble methods that estimate the class posterior probabilities
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)