Pages that link to "Item:Q3169036"
From MaRDI portal
The following pages link to Penalty and Smoothing Methods for Convex Semi-Infinite Programming (Q3169036):
Displayed 13 items.
- Subsmooth semi-infinite and infinite optimization problems (Q715070) (← links)
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming (Q828836) (← links)
- Recent contributions to linear semi-infinite optimization (Q1680760) (← links)
- Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
- Stationarity and regularity of infinite collections of sets: applications to infinitely constrained optimization (Q1935288) (← links)
- An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems (Q1935707) (← links)
- Marco A. López, a pioneer of continuous optimization in Spain (Q2189625) (← links)
- A spline smoothing Newton method for semi-infinite minimax problems (Q2336781) (← links)
- Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case (Q2399192) (← links)
- Comparative study of RPSALG algorithm for convex semi-infinite programming (Q2515065) (← links)
- Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality'' (Q2677659) (← links)
- An exchange method with refined subproblems for convex semi-infinite programming problems (Q2829588) (← links)
- An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems (Q2829601) (← links)