Pages that link to "Item:Q4405727"
From MaRDI portal
The following pages link to A sequential minimization algorithm based on the convexification approach (Q4405727):
Displaying 12 items.
- A new iterative procedure for the numerical solution of coefficient inverse problems (Q557949) (← links)
- An efficient algorithm for solving the inverse problem of locating the interfaces using the frequency sounding data. (Q1868597) (← links)
- Alternating minimization as sequential unconstrained minimization: a survey (Q1949577) (← links)
- Strengthening the sequential convex MINLP technique by perspective reformulations (Q2311102) (← links)
- Approximate methods for convex minimization problems with series-parallel structure (Q2482762) (← links)
- High speed imaging of antipersonnel land mines by the convexification algorithm for a simplified mathematical model in two dimensions (Q3619680) (← links)
- On the Convergence of a Sequential Penalty Function Method for Constrained Minimization (Q3819911) (← links)
- A unified framework for constructing globally convergent algorithms for multidimensional coefficient inverse problems (Q4656465) (← links)
- Sequential greedy approximation for certain convex optimization problems (Q4679946) (← links)
- Imaging of land mines by the globally convergent convexification method using a simplified mathematical model (Q4908337) (← links)
- A Sequential Minimization Technique for Elliptic Quasi-variational Inequalities with Gradient Constraints (Q4915165) (← links)
- Comparative studies of the globally convergent convexification algorithm with application to imaging of antipersonnel land mines (Q5441016) (← links)
