Approximation to nonproper problems of convex programming
From MaRDI portal
Publication:799481
DOI10.1007/BF01157067zbMATH Open0548.90054MaRDI QIDQ799481FDOQ799481
Publication date: 1983
Published in: Mathematical Notes (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)
Cites Work
Cited In (10)
- Inhomogeneous convex approximations of nonsmooth functions
- Title not available (Why is that?)
- Approximate global minimization of nonconvex functions that are close to convex
- The complexity of approximating a nonlinear program
- Non-Convex feasibility problems and proximal point methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximating parameterized convex optimization problems
- On a conjecture in Moreau-Yosida approximation of a nonsmooth convex function
Recommendations
- Title not available (Why is that?) π π
- Approximation methods for problems of nonlinear programming π π
- Approximating optimization problems over convex functions π π
- Nonconvex approximations in unconstrained minimization π π
- Title not available (Why is that?) π π
- Approximating Parameterized Convex Optimization Problems π π
- Approximating parameterized convex optimization problems π π
- Abstract convex approximations of nonsmooth functions π π
- On Approximate Solutions in Convex Vector Optimization π π
- Title not available (Why is that?) π π
This page was built for publication: Approximation to nonproper problems of convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799481)