An unconstrained convex programming approach to convex semi-infinite programming
From MaRDI portal
Publication:3586791
Recommendations
- An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming
- Penalty and smoothing methods for convex semi-infinite programming
- On an exact penalty function method for semi-infinite programming problems
- A regularized penalty method for solving convex semi-infinite programs
- ImplementableL∞penalty-function method for semi-infinite optimization
Cited in
(13)- Global convergence of a class of smooth penalty methods for semi-infinite programming
- Comparative study of RPSALG algorithm for convex semi-infinite programming
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices
- A superlinear \(\mathcal{VU}\) space-decomposition algorithm for semi-infinite constrained programming
- Penalty and smoothing methods for convex semi-infinite programming
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- An approximation approach to non-strictly convex quadratic semi-infinite programming
- Unicity results for general linear semi-infinite optimization problems using a new concept of active constraints
- The regularized constraint aggregation method for a problem of semi-infinite optimization
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- Study of a special nonlinear problem arising in convex semi-infinite programming
- {\(\Gamma\)}-active constraints in convex semi-infinite programming
This page was built for publication: An unconstrained convex programming approach to convex semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586791)
