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...

High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms

Mathematical programming, 2021-05, Vol.187 (1-2), p.47-78

2021

Volltextzugriff (PDF)

Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models

Mathematical programming, 2017-05, Vol.163 (1-2), p.359-368

2017

Volltextzugriff (PDF)

OFFO minimization algorithms for second-order optimality and their complexity

Computational optimization and applications, 2023-03, Vol.84 (2), p.573-607

2023

Volltextzugriff (PDF)

An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity

Mathematical programming, 2021-05, Vol.187 (1-2), p.1-24

2021

Volltextzugriff (PDF)

A note on solving nonlinear optimization problems in variable precision

Computational optimization and applications, 2020-07, Vol.76 (3), p.917-933

2020

Volltextzugriff (PDF)

An adaptive regularization method in Banach spaces

Optimization methods & software, 2023-11, Vol.ahead-of-print (ahead-of-print), p.1-17

2023

Volltextzugriff (PDF)

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems

SIAM journal on optimization, 2010-01, Vol.20 (6), p.2833-2852

2010

Volltextzugriff (PDF)

A concise second-order complexity analysis for unconstrained optimization using high-order regularized models

Optimization methods & software, 2020-03, Vol.35 (2), p.243-256

2020

Volltextzugriff (PDF)

Nonlinear programming without a penalty function or a filter

Mathematical programming, 2010-03, Vol.122 (1), p.155-196

2010

Volltextzugriff (PDF)

Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization

Mathematical programming, 2017, Vol.161 (1-2), p.611-626

2017

Volltextzugriff (PDF)

Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization

SIAM journal on optimization, 2010-01, Vol.20 (6), p.3512-3532

2010

Volltextzugriff (PDF)

A derivative-free trust-funnel method for equality-constrained nonlinear optimization

Computational optimization and applications, 2015-05, Vol.61 (1), p.25-49

2015

Volltextzugriff (PDF)

Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints

Optimization methods & software, 2016-05, Vol.31 (3), p.511-534

2016

Volltextzugriff (PDF)

Complexity of a class of first-order objective-function-free optimization algorithms

Optimization methods & software, 2024-02, p.1-31

2024

Volltextzugriff (PDF)

Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities

SIAM journal on optimization, 2019-01, Vol.29 (1), p.874-903

2019

Volltextzugriff (PDF)

Adaptive regularization minimization algorithms with nonsmooth norms

IMA journal of numerical analysis, 2023-04, Vol.43 (2), p.920-949

2023

Volltextzugriff (PDF)

Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives

Journal of Complexity, 2022-02, Vol.68, p.101591, Article 101591

2022

Volltextzugriff (PDF)

CONVERGENCE OF A REGULARIZED EUCLIDEAN RESIDUAL ALGORITHM FOR NONLINEAR LEAST-SQUARES

SIAM journal on numerical analysis, 2010-01, Vol.48 (1), p.1-29

2010

Volltextzugriff (PDF)

RANGE-SPACE VARIANTS AND INEXACT MATRIX-VECTOR PRODUCTS IN KRYLOV SOLVERS FOR LINEAR SYSTEMS ARISING FROM INVERSE PROBLEMS

SIAM journal on matrix analysis and applications, 2011-07, Vol.32 (3), p.969-986

2011

Volltextzugriff (PDF)

Complexity bounds for second-order optimality in unconstrained optimization

Journal of Complexity, 2012-02, Vol.28 (1), p.93-108

2012

Volltextzugriff (PDF)

An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity

IMA journal of numerical analysis, 2012-10, Vol.32 (4), p.1662-1695

2012

Volltextzugriff (PDF)

Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models

SIAM journal on optimization, 2016-01, Vol.26 (2), p.951-967

2016

Volltextzugriff (PDF)

A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds

Mathematics of computation, 1997-01, Vol.66 (217), p.261-288

1997

Volltextzugriff (PDF)

Trust-region algorithms: Probabilistic complexity and intrinsic noise with applications to subsampling techniques

EURO journal on computational optimization, 2022, Vol.10, p.100043, Article 100043

2022

Volltextzugriff (PDF)

Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients

Optimization methods & software, 2017-11, Vol.32 (6), p.1273-1298

2017

Volltextzugriff (PDF)

1 – 25 von 87

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(75)
Mit Volltextzugriff
(86)

Publikationsform

Sprache

Englisch
(87)

Erscheinungsjahr

n.n

Thema

Mathematics
(61)
Science & Technology
(59)
Mathematics, Applied
(53)
Physical Sciences
(53)
Technology
(35)
Computer Science
(29)
Operations Research & Management Science
(28)
Algorithms
(27)
Exact Sciences And Technology
(26)
Optimization
(24)
Computer Science, Software Engineering
(23)
Numerical Analysis
(17)
Applied Sciences
(15)
Nonlinear Optimization
(15)
Operational Research And Scientific Management
(12)
Operational Research. Management Science
(12)
Mathematical Analysis
(11)
Evaluation Complexity
(10)
Mathematics And Statistics
(10)
Complexity
(9)

15 weitere anzeigen...

Weniger anzeigen...

Menü

Weitere Dienste

Einstellungen

High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms

Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models

OFFO minimization algorithms for second-order optimality and their complexity

An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity

A note on solving nonlinear optimization problems in variable precision

An adaptive regularization method in Banach spaces

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems

A concise second-order complexity analysis for unconstrained optimization using high-order regularized models

Nonlinear programming without a penalty function or a filter

Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization

Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization

A derivative-free trust-funnel method for equality-constrained nonlinear optimization

Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints

Complexity of a class of first-order objective-function-free optimization algorithms

Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities

Adaptive regularization minimization algorithms with nonsmooth norms

Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives

CONVERGENCE OF A REGULARIZED EUCLIDEAN RESIDUAL ALGORITHM FOR NONLINEAR LEAST-SQUARES

RANGE-SPACE VARIANTS AND INEXACT MATRIX-VECTOR PRODUCTS IN KRYLOV SOLVERS FOR LINEAR SYSTEMS ARISING FROM INVERSE PROBLEMS

Complexity bounds for second-order optimality in unconstrained optimization

An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity

Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models

A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds

Trust-region algorithms: Probabilistic complexity and intrinsic noise with applications to subsampling techniques

Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients

Suchergebnisse filtern