Pages that link to "Item:Q969747"
From MaRDI portal
The following pages link to A new smoothing Newton-type algorithm for semi-infinite programming (Q969747):
Displaying 14 items.
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
- Solving semi-infinite programs by smoothing projected gradient method (Q480937) (← links)
- A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations (Q530014) (← links)
- An inexact primal-dual algorithm for semi-infinite programming (Q784788) (← links)
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming (Q828836) (← links)
- A noninterior point homotopy method for semi-infinite programming problems (Q1743361) (← links)
- A smoothing Levenberg-Marquardt algorithm for semi-infinite programming (Q2352422) (← links)
- Smoothing SQP algorithm for semismooth equations with box constraints (Q2376126) (← links)
- A smoothing Levenberg-Marquardt method for generalized semi-infinite programming (Q2392971) (← links)
- Non-convex semi-infinite min-max optimization with noncompact sets (Q2411166) (← links)
- Interior point filter method for semi-infinite programming problems (Q3111139) (← links)
- Feasible Method for Semi-Infinite Programs (Q3461986) (← links)
- On solving a class of linear semi-infinite programming by SDP method (Q4981874) (← links)
- Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications (Q6107989) (← links)
