Augmentability in optimization theory
From MaRDI portal
Publication:1133151
DOI10.1007/BF00934031zbMATH Open0421.49033MaRDI QIDQ1133151FDOQ1133151
Authors: Magnus R. Hestenes 
Publication date: 1980
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- The multiplier method of Hestenes and Powell applied to convex programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the method of multipliers for mathematical programming problems
- On the combination of the multiplier method of Hestenes and Powell with Newton's method
- An Alternate Sufficiency Proof for the Normal Problem of Bolza
- A Nonlinear Optimal Control Minimization Technique
- Theorem of Lindeberg in the Calculus of Variations
Cited In (30)
- Design sensitivity analysis of elastic mechanical systems
- An interval algorithm for constrained global optimization
- Conjugate gradient method for the solution of linear equations: Application to molecular electronic structure calculations
- Breakdowns in the implementation of the Lánczos method for solving linear systems
- Joint ranges of Hermitian matrices and simultaneous diagonalization
- Definiteness and semidefiniteness of quadratic forms revisited
- Abnormality in the theory of necessary optimality conditions
- An interval algorithm for nondifferentiable global optimization
- Conjugate direction methods in non-Hilbert spaces
- The general coupled matrix equations over generalized bisymmetric matrices
- The conjugate gradient method for queueing networks
- Angles between infinite dimensional subspaces with applications to the Rayleigh-Ritz and alternating projectors methods
- A new descent algorithm with curve search rule
- An iterative method for symmetric solutions and optimal approximation solution of the system of matrix equations \(A_{1}XB_{1} = C_{1}, A_{2}XB_{2} = C_{2}\)
- A nonmonotone differential inclusion
- A new taxonomy of conjugate gradient methods
- Convergence of line search methods for unconstrained optimization
- On inertia and Schur complement in optimization
- Numerical solution of the Hele-Shaw equations
- Matrix criteria for the pseudo-P-convexity of a quadratic form
- Spreading of excitation in 3-D models of the anisotropic cardiac tissues. I: Validation of the eikonal model
- A conjugate gradient algorithm for sparse linear inequalities
- Lanczos-type algorithms for solving systems of linear equations
- Projection methods for linear systems
- A globally convergent algorithm based on imbedding and parametric optimization
- A note on the method of multipliers
- A unified derivation for fast estimation algorithms by the conjugate direction method
- An extension of Polyak's theorem in a Hilbert space
- An iterative working-set method for large-scale nonconvex quadratic programming
- A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems
This page was built for publication: Augmentability in optimization theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1133151)
