Approximating parameterized convex optimization problems
From MaRDI portal
Recommendations
- Approximating parameterized convex optimization problems
- Approximating optimization problems over convex functions
- An algorithm for approximate multiparametric convex programming
- An approximation algorithm for a general class of parametric optimization problems
- Approximation to nonproper problems of convex programming
- On Approximate Solutions in Convex Vector Optimization
- Approximate convexity in vector optimisation
- scientific article; zbMATH DE number 4056420
- scientific article; zbMATH DE number 4094251
- Parametric approximation problems arising in vector optimization
Cited in
(24)- Continuous approximate solutions in parametric optimization
- Coderivatives in parametric optimization
- Homotopy continuation approaches for robust SV classification and regression
- Conditional selective inference for robust regression and outlier detection using piecewise-linear homotopy continuation
- Approximate methods for convex minimization problems with series-parallel structure
- An efficient, strongly polynomial, -approximation parametric optimization scheme
- Optimizing over the growing spectrahedron
- Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization
- Parameterized Approximation Problems
- Approximating parameterized convex optimization problems
- scientific article; zbMATH DE number 3902417 (Why is no real title available?)
- Parametric approach to a class of nonconvex global optimization problems
- scientific article; zbMATH DE number 503162 (Why is no real title available?)
- Saturating splines and feature selection
- Convex Parametric Programming in Abstract Spaces
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Optimal parameter characterization of an enhanced mathematical model of solar photovoltaic cell/module using an improved white shark optimization algorithm
- Conservative parametric optimality and the ridge method for tame min-max problems
- From the simplex to the sphere: faster constrained optimization using the Hadamard parametrization
- Path-following methods for maximum a posteriori estimators in Bayesian hierarchical models: how estimates depend on hyperparameters
- Finite -subgradient algorithm for approximate solution of the parametric programming problem
- New methods for parametric optimization via differential equations
- Parametric programming-based approximate selective inference for adaptive lasso, adaptive elastic net and group lasso
- Approximation to nonproper problems of convex programming
This page was built for publication: Approximating parameterized convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933639)
