Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"Primal-dual interior point methods"”.
-
A modified augmented Lagrangian merit function, and Q-superlinear characterization results for primal-dual Quasi-Newton interior-point method for nonlinear programming
Two classes of primal-dual interior-point methods for nonlinear programming are studied. The first class corresponds to a path-following Newton method formulated in terms of the nonnegative variables rather than all primal and dual variables. The centrality condition is a relaxation of the …
-
The Distance to Uncontrollability via Linear Matrix Inequalities
… via the Kalman-Yakubovich-Popov (KYP) lemma. The dual formulation is also considered and leads to rank conditions for exactness verification of the approximation. For the second algorithm, by Dumitrescu, Şicleru and Ştefan, a semidefinite programming problem is derived using a sum-of-squares …
-
Computation of upper and lower bounds in limit analysis using second-order cone programming and mesh adaptivity
… from solving an infinite dimensional saddle point problem, where the internal work rate is maximized over an admissible set of stresses -defined by a yield condition- and minimized over the linear space of kinematically admissible velocities for which the external work rate equals the unity. …
-
Techniques for handling nonsymmetric cones in interior point algorithms
… function over an intersection of symmetric (self-dual and homogeneous) cones are amenable to highly efficient primal-dual interior point methods, which are implemented by many popular off-the-shelf conic solvers. On the other hand, many useful conic sets cannot be modeled exactly or can be modeled …
-
Regularisation methods for imaging from electrical measurements
… stable solution of which requires regularisation methods. Most common regularisation methods impose that the reconstructed image should be smooth. Such methods confer stability to the reconstruction process, but limit the capability of describing sharp variations in the sought parameter. In this …
-
Inexact interior point methods for constrained convex quadratic optimization problems
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms