Augmentability in optimization theory
From MaRDI portal
Publication:1133151
DOI10.1007/BF00934031zbMath0421.49033MaRDI QIDQ1133151
Publication date: 1980
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items
An interval algorithm for constrained global optimization, An interval algorithm for nondifferentiable global optimization, Convergence of line search methods for unconstrained optimization, Abnormality in the theory of necessary optimality conditions, The general coupled matrix equations over generalized bisymmetric matrices, On inertia and Schur complement in optimization, A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems, The conjugate gradient method for queueing networks, A new taxonomy of conjugate gradient methods, Joint ranges of Hermitian matrices and simultaneous diagonalization, 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}\), Numerical solution of the Hele-Shaw equations, Matrix criteria for the pseudo-P-convexity of a quadratic form, A conjugate gradient algorithm for sparse linear inequalities, A nonmonotone differential inclusion, Conjugate gradient method for the solution of linear equations: Application to molecular electronic structure calculations, A globally convergent algorithm based on imbedding and parametric optimization, Projection methods for linear systems, Breakdowns in the implementation of the Lánczos method for solving linear systems, A new descent algorithm with curve search rule, Angles between infinite dimensional subspaces with applications to the Rayleigh-Ritz and alternating projectors methods, Design sensitivity analysis of elastic mechanical systems, Conjugate direction methods in non-Hilbert spaces, Lanczos-type algorithms for solving systems of linear equations, Spreading of excitation in 3-D models of the anisotropic cardiac tissues. I: Validation of the eikonal model, An extension of Polyak's theorem in a Hilbert space, A note on the method of multipliers, Definiteness and semidefiniteness of quadratic forms revisited, An iterative working-set method for large-scale nonconvex quadratic programming, A unified derivation for fast estimation algorithms by the conjugate direction method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the combination of the multiplier method of Hestenes and Powell with Newton's method
- On the method of multipliers for mathematical programming problems
- The multiplier method of Hestenes and Powell applied to convex programming
- A Nonlinear Optimal Control Minimization Technique
- An Alternate Sufficiency Proof for the Normal Problem of Bolza
- Theorem of Lindeberg in the Calculus of Variations
