Optimizing Condition Numbers

DOI10.1137/080740544zbMath1198.90328OpenAlexW2026174223MaRDI QIDQ3563915

Pierre Maréchal, Jane J. Ye

Publication date: 1 June 2010

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d91da1ab30b10ee5b1e6f1087fb96aae56b28038

zbMATH Keywords

quasiconvex functionsConditon numbersexact and inexact approximationsnonsmooth convex programs.strongly pseudoconvex functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (13)

Condition Number Minimization in Euclidean Jordan Algebras ⋮ A neurodynamic approach to nonlinear optimization problems with affine equality and convex inequality constraints ⋮ A neurodynamic approach to nonsmooth constrained pseudoconvex optimization problem ⋮ A one-layer recurrent neural network for nonsmooth pseudoconvex optimization with quasiconvex inequality and affine equality constraints ⋮ Optimization Methods for Frame Conditioning and Application to Graph Laplacian Scaling ⋮ Unnamed Item ⋮ A recurrent neural network for solving a class of generalized convex optimization problems ⋮ A fast gradient and function sampling method for finite-max functions ⋮ Smoothing methods for nonsmooth, nonconvex minimization ⋮ Interpolation of Inverse Operators for Preconditioning Parameter-Dependent Equations ⋮ Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization ⋮ On the differentiability check in gradient sampling methods ⋮ K-Optimal Design via Semidefinite Programming and Entropy Optimization

This page was built for publication: Optimizing Condition Numbers