The following pages link to Jürgen Guddat (Q586366):
Displayed 50 items.
- Item:Q586366 (redirect page) (← links)
- The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations (Q687034) (← links)
- A potential-reduction variant of Renegar's short-step path-following method for linear programming (Q811094) (← links)
- A polynomial-time algorithm, based on Newton's method, for linear programming (Q1108927) (← links)
- Solving inequality constrained optimization problems by differential homotopy continuation methods (Q1117143) (← links)
- Item:Q586366 (redirect page) (← links)
- A globally convergent algorithm based on imbedding and parametric optimization (Q1171362) (← links)
- Global multidimensional optimization on parallel computer (Q1195710) (← links)
- A unified approach to interior point algorithms for linear complementary problems (Q1202150) (← links)
- Some applications of mathematical programming techniques in optimal power dispatch (Q1206797) (← links)
- Relaxation methods for strictly convex regularizations of piecewise linear programs (Q1273445) (← links)
- Some lower bounds for the complexity of continuation methods (Q1279910) (← links)
- Ekeland's \(\varepsilon\)-variational principle for set-valued mappings (Q1298713) (← links)
- Stability results for Ekeland's \(\varepsilon\) variational principle for vector valued functions (Q1298736) (← links)
- Equivalents of an approximate variational principle for vector-valued functions and applications (Q1299926) (← links)
- Inexact-Newton methods for semismooth systems of equations with block-angular structure (Q1301816) (← links)
- Structure variable homotopy methods for solving nonlinear systems (Q1316156) (← links)
- Some outer approximation methods for semi-infinite optimization problems (Q1343650) (← links)
- A multiprojection algorithm using Bregman projections in a product space (Q1344108) (← links)
- A projective quasi-Newton method for nonlinear optimization (Q1344341) (← links)
- A special nonlinear least-squares problem (Q1344343) (← links)
- Triangulations and simplicial methods (Q1346640) (← links)
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms (Q1368737) (← links)
- Alternating multi-step quasi-Newton methods for unconstrained optimization (Q1372056) (← links)
- Polynomial root finding by means of continuation (Q1377268) (← links)
- Heuristic methods for computing the minimal multi-homogeneous Bézout number. (Q1412521) (← links)
- Properties of a homotopy solution path for complementarity problems with quasi-monotone mappings. (Q1415265) (← links)
- Piecewise linear methods for nonlinear equations and optimization (Q1593829) (← links)
- Simplicial algorithms on the simplotope (Q1801282) (← links)
- Numerical analysis of the efficiency of an algorithm for approximating convex bodies by polyhedra (Q1803476) (← links)
- Extremum points of a convex function (Q1805278) (← links)
- Approximating the noninferior set in linear biobjective programs using multiparametric decomposition (Q1823867) (← links)
- Some special situations in linear fractional programming problem: An algorithmic comparison (Q1825774) (← links)
- Global minimum point of a convex function (Q2365620) (← links)
- A modified standard embedding with jumps in nonlinear optimization (Q2572889) (← links)
- (Q3026778) (← links)
- (Q3039050) (← links)
- (Q3221978) (← links)
- On imbedding and parametric optimization—A concept of a globally convergent algorithm for nonlinear optimization problems (Q3340648) (← links)
- Critical sets in one-parametric mathematical programs with complementarity constraints (Q3498595) (← links)
- (Q3528710) (← links)
- (Q3531054) (← links)
- (Q3531063) (← links)
- (Q3531069) (← links)
- (Q3541566) (← links)
- (Q3606293) (← links)
- (Q3662534) (← links)
- (Q3674408) (← links)
- (Q3674409) (← links)
- (Q3691438) (← links)