UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

A conjugate directions approach to improve the limited-memory BFGS method

Applied mathematics and computation, 2012-10, Vol.219 (3), p.800-809

2012

Volltextzugriff (PDF)

Generalizations of the limited-memory BFGS method based on the quasi-product form of update

Journal of computational and applied mathematics, 2013-03, Vol.241, p.116-129

2013

Volltextzugriff (PDF)

Globally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization

Journal of optimization theory and applications, 2001-11, Vol.111 (2), p.407-430

2001

Volltextzugriff (PDF)

Inexact trust region method for large sparse systems of nonlinear equations

Journal of optimization theory and applications, 1994-06, Vol.81 (3), p.569-590

LUKSAN, L

1994

Volltextzugriff (PDF)

Globally convergent variable metric method for convex nonsmooth unconstrained minimization

Journal of optimization theory and applications, 1999-09, Vol.102 (3), p.593-613

1999

Volltextzugriff (PDF)

Hybrid methods for large sparse nonlinear least squares

Journal of optimization theory and applications, 1996-06, Vol.89 (3), p.575-595

LUKSAN, L

1996

Volltextzugriff (PDF)

Computational experience with known variable metric updates

Journal of optimization theory and applications, 1994-10, Vol.83 (1), p.27-47

Luksan, L

1994

Volltextzugriff (PDF)

Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations

Optimization methods & software, 1998-01, Vol.8 (3-4), p.201-223

1998

Volltextzugriff (PDF)

Globally Convergent Variable Metric Method for Convex Nonsmooth Unconstrained Minimization1

Journal of optimization theory and applications, 1999-09, Vol.102 (3), p.593-613

1999

Volltextzugriff (PDF)

Truncated trust region methods based on preconditioned iterative subalgorithms for large sparse systems of nonlinear equations

Journal of optimization theory and applications, 1997-12, Vol.95 (3), p.637-658

1997

Volltextzugriff (PDF)

Variationally derived scaling and variable metric updates from the preconvex part of the Broyden family

Journal of optimization theory and applications, 1992-05, Vol.73 (2), p.299-307

LUKSAN, L

1992

Volltextzugriff (PDF)

Comparing Nonsmooth Nonconvex Bundle Methods in Solving Hemivariational Inequalities

Journal of global optimization, 1999-03, Vol.14 (2), p.117

1999

Volltextzugriff (PDF)

Trust-region interior-point method for large sparse l 1 optimization

Optimization methods & software, 2007-10, Vol.22 (5), p.737-753

2007

Volltextzugriff (PDF)

A bundle-Newton method for nonsmooth unconstrained minimization

Mathematical programming, 1998-11, Vol.83 (3), p.373-391

1998

Volltextzugriff (PDF)

On Lagrange multipliers of trust-region subproblems

BIT (Nordisk Tidskrift for Informationsbehandling), 2008-12, Vol.48 (4), p.763-768

2008

Volltextzugriff (PDF)

A compact variable metric algorithm for nonlinear minimax approximation

Computing, 1986-12, Vol.36 (4), p.355-373

LUKSAN, L

1986

Volltextzugriff (PDF)

Shifted limited-memory variable metric methods for large-scale unconstrained optimization

Journal of computational and applied mathematics, 2006-02, Vol.186 (2), p.365-390

2006

Volltextzugriff (PDF)

Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximation

Kybernetika, 1984, Vol.20 (6), p.445-457

LUKŠAN, L

1984

Volltextzugriff (PDF)

New combined method for unconstrained minimization

Computing, 1982-06, Vol.28 (2), p.155-169

Lukšan, L.

1982

Volltextzugriff (PDF)

Variable metric methods for unconstrained optimization and nonlinear least squares

Journal of computational and applied mathematics, 2000-12, Vol.124 (1), p.61-95

2000

Volltextzugriff (PDF)

Variable metric methods for a class of extended conic functions

Kybernetika, 1985, Vol.21 (2), p.96-107

LUKŠAN, L

1985

Volltextzugriff (PDF)

Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems

Numerical linear algebra with applications, 1998-05, Vol.5 (3), p.219-247

1998

Volltextzugriff (PDF)

Software Package for Optimization and Nonlinear Approximation

IFAC Proceedings Volumes, 1979-09, Vol.12 (3), p.361-365

Lukšan, L.

1979

Volltextzugriff (PDF)

Interior-point method for non-linear non-convex optimization

Numerical linear algebra with applications, 2004-06, Vol.11 (5-6), p.431-453

2004

Volltextzugriff (PDF)

Algorithm 811: NDA: algorithms for nondifferentiable optimization

ACM transactions on mathematical software, 2001-06, Vol.27 (2), p.193-213

2001

Volltextzugriff (PDF)

1 – 25 von 41

Menü

Weitere Dienste

Einstellungen

A conjugate directions approach to improve the limited-memory BFGS method

Generalizations of the limited-memory BFGS method based on the quasi-product form of update

Globally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization

Inexact trust region method for large sparse systems of nonlinear equations

Globally convergent variable metric method for convex nonsmooth unconstrained minimization

Hybrid methods for large sparse nonlinear least squares

Computational experience with known variable metric updates

Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations

Globally Convergent Variable Metric Method for Convex Nonsmooth Unconstrained Minimization1

Truncated trust region methods based on preconditioned iterative subalgorithms for large sparse systems of nonlinear equations

Variationally derived scaling and variable metric updates from the preconvex part of the Broyden family

Comparing Nonsmooth Nonconvex Bundle Methods in Solving Hemivariational Inequalities

Trust-region interior-point method for large sparse l 1 optimization

A bundle-Newton method for nonsmooth unconstrained minimization

On Lagrange multipliers of trust-region subproblems

A compact variable metric algorithm for nonlinear minimax approximation

Shifted limited-memory variable metric methods for large-scale unconstrained optimization

Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximation

New combined method for unconstrained minimization

Variable metric methods for unconstrained optimization and nonlinear least squares

Variable metric methods for a class of extended conic functions

Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems

Software Package for Optimization and Nonlinear Approximation

Interior-point method for non-linear non-convex optimization

Algorithm 811: NDA: algorithms for nondifferentiable optimization

Suchergebnisse filtern