Robust solutions of nonlinear least squares problems via min-max optimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
- Error Bounds for Piecewise Convex Quadratic Programs and Applications
- Introductory lectures on convex optimization. A basic course.
- Julia: a fresh approach to numerical computing
- Linearly constrained nonsmooth optimization for training autoencoders
- Lower bounds for finding stationary points I
- Multicomposite nonconvex optimization for training deep neural networks
- On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
- Optimality Conditions for Nonsmooth Nonconvex-Nonconcave Min-Max Problems and Generative Adversarial Networks
- Quadratic programming with one negative eigenvalue is NP-hard
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Smoothing methods for nonsmooth, nonconvex minimization
- Zur Theorie der Gesellschaftsspiele.
This page was built for publication: Robust solutions of nonlinear least squares problems via min-max optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7267099)