Scalable subspace methods for derivative-free nonlinear least-squares optimization (Q6038650): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 17:57, 30 December 2024

scientific article; zbMATH DE number 7681259

Language	Label	Description	Also known as
English	Scalable subspace methods for derivative-free nonlinear least-squares optimization	scientific article; zbMATH DE number 7681259

Statements

scholarly article

0 references

Scalable subspace methods for derivative-free nonlinear least-squares optimization (English)

0 references

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

2 May 2023

0 references

full work available at URL

https://arxiv.org/abs/2102.12016

0 references

zbMATH Keywords

derivative-free optimization

0 references

large-scale optimization

0 references

nonlinear least-squares

0 references

worst case complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

Two decades of blackbox optimization applications

0 references

Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization

0 references

Convergence of Trust-Region Methods Based on Probabilistic Models

0 references

Sharp nonasymptotic bounds on the norm of random matrices with independent entries

0 references

An investigation of Newton-Sketch and subsampled Newton methods

0 references

A theoretical and empirical comparison of gradient approximations in derivative-free optimization

0 references

Levenberg--Marquardt Methods Based on Probabilistic Gradient Models and Inexact Subproblem Solution, with Application to Data Assimilation

0 references

Stochastic Three Points Method for Unconstrained Smooth Minimization

0 references

Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers

0 references

Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings

0 references

A derivative-free Gauss-Newton method

0 references

Global convergence rate analysis of unconstrained optimization methods based on probabilistic models

0 references

Stochastic optimization using a trust-region method and random models

0 references

Connected components in random graphs with given expected degree sequences

0 references

Optimizing partially separable functions without derivatives

0 references

Trust Region Methods

0 references

Geometry of interpolation sets in derivative free optimization

0 references

Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points

0 references

Introduction to Derivative-Free Optimization

0 references

A Derivative-Free Method for Structured Optimization Problems

0 references

Benchmarking optimization software with performance profiles.

0 references

0 references

Inexact derivative-free optimization for bilevel learning

0 references

Parallel Selective Algorithms for Nonconvex Big Data Optimization

0 references

Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case

0 references

Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming

0 references

0 references

CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization

0 references

Stochastic quasi-gradient methods: variance reduction via Jacobian sketching

0 references

Direct Search Based on Probabilistic Descent

0 references

Complexity and global rates of trust-region methods based on probabilistic models

0 references

Direct search based on probabilistic feasible descent for bound and linearly constrained problems

0 references

Optimization by moving ridge functions: derivative-free optimization for computationally intensive functions

0 references

Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions

0 references

Error bounds for overdetermined and underdetermined generalized centred simplex gradients

0 references

Sparser Johnson-Lindenstrauss Transforms

0 references

Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition

0 references

A stochastic subspace approach to gradient-free optimization in high dimensions

0 references

Derivative-free optimization methods

0 references

A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming

0 references

Randomized Algorithms for Matrices and Data

0 references

Benchmarking Derivative-Free Optimization Algorithms

0 references

Random gradient-free minimization of convex functions

0 references

Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization

0 references

Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence

0 references

On trust region methods for unconstrained minimization without derivatives

0 references

Least Frobenius norm updating of quadratic models that satisfy interpolation conditions

0 references

Sub-sampled Newton methods

0 references

0 references

Worst case complexity of direct search

0 references

Bayesian Optimization in a Billion Dimensions via Random Embeddings

0 references

Advances and Trends in Optimization with Engineering Applications

0 references

Computational Advertising: Techniques for Targeting Relevant Ads

0 references

Coordinate descent algorithms

0 references

Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization

0 references

A globally convergent algorithm for nonconvex optimization based on block coordinate update

0 references

Inexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization

0 references

A Derivative-Free Algorithm for Least-Squares Minimization

0 references

Identifiers

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S10107-022-01836-1

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6038650

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6038650&oldid=39668791"