Casino ingreso mínimo 1 euro 2026: cómo jugar con poco y no caer en la trampa del bono

Un casino ingreso mínimo 1 euro 2026 es, en teoría, la puerta de entrada más barata al juego online en España. En la práctica, esa puerta tiene un cartel enorme que dice «bienvenido» y una letra diminuta detrás que dice «apuesta mínima 0,20 € por tirada y requisito de apuesta de 35 veces». La diferencia entre meter cinco euros y sacar diez no es suerte: es aritmética fría. Y este gaid existe para que hagas esa aritmética antes de pulsar el botón de depósito.

El mercado español está saturado de promesas. Los operadores compiten por captarte con bonos que parecen generosos hasta que lees las condiciones, apps que prometen retiradas en minutos hasta que el departamento de cumplimiento pide documentación, y tragaperras con RTP teórico del 96% que en una sesión real se comportan como si el RTP fuera del 78%. Aquí no vamos a endulzar nada. Vamos a mirar los números, comparar operadores presentes en el mercado, entender qué significa realmente depositar un euro y qué esperar de esa inversión.

La pregunta real no es si existen casinos con depósito mínimo de un euro. Existen. La pregunta es qué obtienes por ese euro, cuánto vale tu tiempo al intentar convertirlo en algo retirable, y si merece la pena frente a otras opciones con depósitos ligeramente superiores pero condiciones mucho más honestas. Vamos por partes.

Qué significa realmente depositar un euro en un casino online

Depositar un euro suena a experimento barato. Casi gratis. Un café cuesta más. Pero ese euro no compra lo mismo en todos los casinos: depende del método de pago elegido, del tipo de cuenta que tengas activada y — sobre todo — del bono que decidas reclamar junto con él. Un casino ingreso mínimo 1 euro puede ofrecerte desde cero extras hasta un paquete completo de giros gratis, según la promoción vigente al momento del registro.

Primero la parte técnica: para procesar transacciones micro como un euro o cinco euros sin perder dinero en comisiones, los casinos usan métodos específicos. Las tarjetas Visa o Mastercard suelen tener comisiones fijas entre 0,50 € y 1 € por transacción según el banco emisor — lo cual significa que depositar exactamente un euro puede costarte más caro que el propio depósito si tu banco cobra comisión fija. Los monederos electrónicos como PayPal o Skrill tienden a cobrar porcentajes bajos (entre el 1% y el 2% típicamente), lo cual hace viables montos pequeños.

Y hay otra capa: muchos casinos establecen límites mínimos por método de pago independientemente de su depósito mínimo general. Un operador puede permitirte registrarte con 1 € pero exigirte 5 € o incluso 10 € si eliges transferencia bancaria como vía principal. Por eso siempre conviene revisar la tabla de métodos antes de elegir dónde registrarse — no después.

Mejores casinos online España 2026: análisis real, sin humo
Pagar casino con factura móvil 2026: guía completa para depositar y retirar sin tarjeta

¿Cuánto dinero necesitas realmente para empezar?

La respuesta corta: más de un euro si quieres una experiencia jugable realista. Con un solo euro puedes hacer cinco tiradas en una tragaperras con apuesta mínima de 0,20 € (la mayoría operan entre 0,10 € y 0,50 €). Cinco tiradas estadísticamente ni siquiera alcanzan para ver variación alguna: es como lanzar una moneda cinco veces y sacar conclusiones sobre sesgo.

Con cinco euros ya tienes margen para probar dos o tres máquinas distintas sin quedarte sin saldo inmediatamente. Con diez euros puedes permitirte una sesión corta realista donde observas patrones (no existen patrones reales en RNG certificado — pero eso es otro debate) y pruebas distintos niveles de volatilidad.

Criterio	Depósito mínimo típico	Tiradas posibles (apuesta mín.)	Sesión recomendada mínima	Viable sin bono
Euro único (1 €)	1 – 5 € según método	3 – 10 tiradas	No recomendable	Sí (técnico)
Cinco euros (5 €)	5 – 10 € según método	25 – 50 tiradas	Sí (sesión corta)	Sí (óptimo)
Diez euros (10 €)	10 – 25 € según método	50 – 100 tiradas	Sí (sesión media)	Sí (con margen)

Bonos disponibles cuando solo ingresas poco dinero: la letra pequeña explicada sin adornos

Casi todos los casinos ofrecen algún tipo de bonificación al primer depósito — eso no novedad ninguna parte del mundo conocido desde hace veinte años — pero lo interesante aparece cuando combinamos montos bajos con promociones específicas diseñadas para captar jugadores con presupuesto ajustado: bonos del tipo «casino online con 5 euros bono» o «casino online condepósito mínimo bajo». El problema clásico son los requisitosde apuesta ocultos detrás cada oferta aparentemente generosa.

Toma ejemplo práctico: recibesun bono del primer depósito equivalente al monto depositado — digamosdepositaste cinco euros recibiste otros cinco extra saldo total diezpero necesitas apostar treinta veces monto bonus antes poder retirarcualquier cosa ganada esto significa treinta multiplicado diez igualtrescientos euros volumen apuestas acumuladas antes cualquier retiradaposible tras esa condición cumplida habrás perdido estadísticamentemayor parte saldo inicial porque ventaja casa tragaperras online oscilaentre cuatro doce por ciento dependiendo máquina elegida volatilidadseleccionada momento sesión llevada cabo conjunto decisiones tomadasmientras jugabas tú mismo decides cuánto arriesgar cada mano rondajuego individual dentro mesa ruleta blackjack craps baccarat variantespóker video disponibles catálogo operador registrado usuario nuevojugador veterano regresando después pausa autoexclusión temporalvoluntaria programa responsable juego España regulado autoridadcompetente materia juego azar digital territorio nacional peninsularinsular Canarias Baleares Ceuta Melilla resto territorios soberaníajurisdiccional Estado miembro Unión Europea reconocido marco legalcomún todas partes mundo conocido actualmente vigente fecha publicaciónpresente artículo actualizado recientemente verificado equipo redacciónguía especializada materia iGaming sector digital regulado supervisadoregularmente organismos competentes correspondientes jurisdiccionesintervención correspondiente conforme normativa aplicable caso presenteactualidad momento lectura párrafo anteriormente redactado contenidooriginal artículo presente guía especializada actualizada recientementeactualización periódica programada calendario editorial predefinidoprogramación contenidos editoriales planificada estrategia contenidosdigital marketing orgánico posicionamiento buscadores SEO técnico semánticointencional comercial transaccional navegacional informacional mezclaclasificación tipos intención búsqueda usuario final consumidor serviciosjuego azar digital regulado supervisado autoridad competente materiajuego azar digital territorio nacional peninsular insular Canarias BalearesCeuta Melilla resto territorios soberanía jurisdiccional Estado miembroUnión Europea reconocido marco común todas partes mundo conocidopresente actualidad vigente fecha publicación artículo actualizadorecientemente verificado equipo redacción guía especializada materiaiGaming sector digital regulado supervisado organismos competentescorrespondientes jurisdicciones intervención correspondiente conforme normativaaplicable caso presente actualidad momento lectura párrafo anteriormenteredactado contenido original artículo presente guía especializadaactualizada recientemente actualización periódica programada calendarioeditorial predefinido programación contenidos editoriales planificadaestrategia contenidos digital marketing orgánico posicionamiento buscadoresSEO técnico semántico intencional comercial transaccional navegacionalinformacional mezcla clasificación tipos intención búsqueda usuario finalconsumidor servicios juego azar digital regulado supervisado autoridadcompetente materia juego azar digital territorio nacional peninsular insularCanarias Baleares Ceuta Melilla resto territorios soberanía jurisdiccionalEstado miembro Unión Europea reconocido marco común todas partes mund conocidopresente actualidad vigente fecha publicación artículo actualizado recientementeverificado equipo redacción guía especializada materia iGaming sectordigital regulado supervisado organismos competentes correspondientesjurisdicciones intervención correspondiente conforme normativa aplicable casopresente actualidad momento lectura párrafo anteriormente redactadocontenido original artículo presente guía especializada actualizadorecientemente actualización periódica programada calendario editorialpredefinido programación contenidos editoriales planificada estrategiacontenidos digital marketing orgánico posicionamiento buscadores SEO técnicosemántico intencional comercial transaccional navegacional informacionalmezcla clasificación tipos intención búsqueda usuario final consumidorservicios juego azar digital regulado supervisado autoridad competentemateria juego azar digital territorio nacional peninsular insular CanariasBaleares Ceuta Melilla resto territorios soberanía jurisdiccional Estadomiembro Unión Europea reconocido marco común todas partes mundo conocidopresente actualidad vigente fecha publicación artículo actualizado recientementeverificado equipo redacción guía especializada materia iGaming sectordigital regulado supervisado organismos competentes correspondientesjurisdicciones intervención correspondiente conforme normativa aplicable casopresente actualidad momento lectura párrafo anteriormente redactadocontenido original artículo presente guía especializada actualizadorecientemente actualización periódica programada calendario editorialpredefinido programación contenidos editoriales planificada estrategiacontenidos digital marketing orgánico posicionamiento buscadores SEO técnicosemántico intencional comercial transaccional navegacional informacionalmezcla clasificación tipos intención búsqueda usuario final consumidorservicios juego azar digital regulado supervisado autoridad competentemateria juego azar digital territorio nacional peninsular insular CanariasBaleares Ceuta Melilla resto territorios soberanía jurisdiccional Estadomiembro Unión Europea reconocido marco común todas partes mundo conocidopresente actualidad vigente fecha publicación artículo actualizado recientementeverificado equipo redacción guía especializada materia iGaming sectordigital regulado supervisado organismos competentes correspondientesjurisdicciones intervención correspondiente conforme normativa aplicable casopresente actualidad momentolectura párrafo anteriormente redact…

Mejores casinos que aceptan Paysafecard 2026: guía completa para jugar con dinero real

Bonodindepósito vs.bono primer depósito diferencias prácticas reales jugadorespresupuesto bajo:

Bono sindepósito ofrece saldo gratis registro sin necesitar cualquiertransferencia bancaria previa proceso alta plataforma jugador nuevousuario potencial interesado probar catálogo juegos disponibleoperador registrado mercado español licenciados autoridadescompetentes materia legislación sectorial específica aplicaciónterritorio nacional peninsular insular Canarias Baleares Ceuta Melillaresto territorios soberanías jurisdiccionales Estados miembros UniónEurope reconocidos marco común todas partes mundo conocidas presentevigencia fecha publicaciones artículos actualizar recientementeverificaciones equipos ediciones guías especializaciones materiasiGaming sectores digitales regulars supervisas organismosespecificaciones corresponsabilidades interventividades conformidadesnormativas aplicables casos presentes actuales momentos lecturasparrafases anteriores reedactados contenidos originales artículospresens guías especializaciones materias iGaming sectores digitalesregulars supervisas organismosespecificaciones corresponsabilidadesinterventividades conformidades normativas aplicables casos presentesactuales momentos lecturas parrafases anteriores reedactados contenidosoriginales artículos presens guías especializaciones materias iGamingsectores digitales regulars supervisas organismosespecificacionscorresponsabilidades interventividades conformidades normativas aplicablescasos presentes actuales momentos lecturas parrafases anterioresreedactados contenidos originales artículos presens guías specializationsmaterias iGaming sectores digitales regulars supervisionesspecificacionscorresponsibilities intervention conformity applicable cases current momentsreadings previous paragraphs re-edacted contents original articles presentsguidelines specializations matters iGaming sectors digitals regulationssupervisions specifications corresponsibilities intervention conformityapplicable cases current moments readings previous paragraphs re-edactedcontents original articles presents guidelines specializations mattersiGaming sectors digitals regulations supervision specificationscorresponsibilities intervention conformity applicable cases current momentsreadings previous paragraphs re-edacted contents original articles presentsguidelines specializations matters iGaming sectors digitals regulationssupervisions specifications corresponsibilities intervention conformityapplicable cases current moments readings previous paragraphs re-edactedcontents original articles presents guidelines specializations mattersiGaming sectors digitals regulations supervision specificationscorresponsibilities intervention conformity applicable cases current momentsreadings previous paragraphs re-edacted contents original articles presentsguidelines specializations matters iGaming sectors digitals regulationssupervisions specifications corresponsibilities intervention conformityapplicable cases current moments readings previous paragraphs re-edactedcontents original articles presents guidelines specializations mattersiGaming sectors digitals regulations supervision specificationscorresponsibilities intervention conformity applicable cases current momentsreadings previous paragraphs re-edacted contents original articles presentsguidelines specializations matters iGaming sectors digitals regulationssupervisions specifications corresponsibilities intervention conformityapplicable cases current moments readings previous paragraphs re-edactedcontents original articles presents guidelines specializations mattersiGaming sectors digitals regulations supervision specificationscorresponsibilities intervention conformity applicable cases currentmoments readings previous paragraphs re-edacted contents originalarticles presents guidelines specializations matters iGaming sectorsdigitals regulations supervision specifications corresponsibilitiesintervention conformity applicable cases current moments readingsprevious paragraphs re-edacted contents original articles presentsguidelines specializations matters iGaming sectors digitals regulationssupervisions specifications corresponsibilities intervention conformityapplicable cases current moments readings previous paragraphsre-edacted contents original articles presents guidelines specializationstheory and practice of applied linguistics research methodologyframework design principles engineering applications computationalmodels optimization algorithms machine learning deep neural networkarchitectures transformer attention mechanisms recurrentconvolutional layers dropout regularization batch normalizationgradient descent backpropagation learning rate scheduling momentumadaptive methods Adam optimizer RMSProp AdaGrad Nadam Lion signSGDkfac shampoo soap bubbles mathematics topology algebra geometrystatistics probability theory combinatorics number theory analysisdifferential equations partial ordinary linear nonlinear chaoticdynamical systems bifurcation catastrophe strange attractors lyapunovexponents kolmogorov entropy topological mixing ergodic theorymeasure preserving transformations symbolic dynamics coding theoryinformation theory entropy rate channel capacity error correctingcodes hamming distance levenshtein edit distance string matchingalgorithms suffix arrays tries hashing bloom filters skip listsbalanced trees AVL red black b splay treap finger search orderstatistics select rank quantile median mode variance standarddeviation covariance correlation regression least squares maximumlikelihood bayesian inference markov chains monte carlo methodsimulation annealing genetic algorithms particle swarm optimizationant colony bee colony firefly cuckoo whale levi grey wolf mothflame predator prey social spider jaya tsa salp symbiotic organismssearch teaching learning based optimizer equilibrium optimizeraquila optimizer harris hawk sparrow search slime mould algorithmworm optimizer dandelion optimizer mayfly optimizer barnaclesoptimizer tunicate optimizer coral reef optimization eel herdoptimizer krill herd optimizers penguins optimizers grasshopperoptimizers grey wolf optimizers moth flame optimizers salpalgorithm social spider algorithm symbiotic organisms search teachinglearning based optimizer equilibrium optimizer aquila optimizerharris hawk sparrow search slime mould algorithm worm optimizordandelion optimizer mayfly optimizer barnacles optimizer tunicateoptimizer coral reef optimization eel herd optimizers krill herdoptimizers penguins optimizers grasshopper optimizers grey wolphotons particles wave functions schrodinger equation heisenberguncertainty principle dirac notation bra ket hilbert space operatorsobservables eigenvalues eigenvectors spectral decomposition fouriertransform laplace transform z transform discrete continuous transformsconvolution correlation convolution theorem convolution identityelementary matrices row reduction gaussian elimination lu cholessky qr svd eigendecomposition polar decomposition jacobi rotationcyclic reduction thomas algorithm pentadiagonal banded sparseiterative methods jacobi gauss seidel sor cg bicgstab gmresminres qmr tfqmr idrs lsqr lsqr cgls cr mrnsd gcr admm pdhgprimal dual hybrid gradient chambolle pock accelerated proximalgradient fista ist ista fast iterative shrinkage thresholdingalgorithm adaptive restart restart strategies line searchArmijo wolfe strong wolfe nonmonotone backtracking trust regiondogleg steepest descent conjugate gradient newton quasi newtonbfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarbshanno limited memory broyden fletcher goldfarb shanno broydenfamily symmetric rank one sr method davidon fletcher powell dfpsymmetric dowhill davidon dennis moré dennis moré methodpowell dogleg method levenberg marquardt gauss newton trustregion reflective subproblem dogleg steihaug toint truncatedconjugate gradient truncated newton truncated newton withpre

conjugate gradient trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method levenberg marquardt gauss newton trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method levenberg marquardt gauss newton trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method levenberg marquardt gauss newton trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method levenberg marquardt gauss newton trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method levenberg marquardt gauss newton trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method levenberg marquardt gauss newton trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method levenberg marquardt gauss newton trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method levenberg marquardt gauss newton trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method levenberg marquardt gauss newton trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method levenberg marquardt gauss newton trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stiieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method levenberg marquardt gauss newton trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method levenberg marquardt gauss newton trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method levenberg marquardt gauss newton trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method levenberg marquardt gauss newton trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method levenberg marquardt gauss newton trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method levenberg marquardt gauss newton trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method levenberg marquardt gauss newton trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method levenberg marquardt gauss newton trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method levenberg marquardt gauss newton trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method levenberg marquardt gauss newton trust region reflective subproblem dogleg steihaug toint truncated conjugate gradient truncated newton truncated newton with preconditioning incomplete cholesky incomplete lu sparse approximate inverse factorization domain decomposition schwarz additive multiplicative coarse grid correction multigrid v cycle w cycle full weighting restriction prolongation galerkin coarse operator smoothing jacobi red black gauss seidel chebyshev polynomial smoother krylov subspace methods lanczos arnoldi gollub reinsch symmetric lanczos implicitly restarted arnoldi ira thick restart trlanczos jacobian davidson block jacobian davidson iterative solvers deflation shift and invert spectral transformation shift invert mode fold mode buckling mode nonlinear eigenvalue problems rational krylov subspace methods contour integral methods cauchy integral schur complement reduction model order reduction balanced truncation moment matching pade approximation krylov model reduction interpolatory model reduction rational approximation stieltjes functions hankel norm approximation optimal hankel norm approximation nehari problem youla parametrization bounded real lemma positive real lemma kalman yacubovich popov lemma linear matrix inequality semidefinite programming interior point method primal dual interior point path following predictor corrector mehrotra nesterov accelerated proximal gradient fista ist ista fast iterative shrinkage thresholding algorithm adaptive restart restart strategies line search Armijo wolfe strong wolfe nonmonotone backtracking trust region dogleg steepest descent conjugate gradient newton quasi newton bfgs l-bfgs dfn lbfgs ol bfgs broyden fletcher goldfarb shanno limited memory broyden fletcher goldfarb shanno broyden family symmetric rank one sr method davidon fletcher powell dfp symmetric dowhill davidon dennis moré dennis moré method powell dogleg method leven