Publication | Date of Publication | Type |
---|
Logarithmic SUMT limits in convex programming | 2002-05-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4323616 | 1995-02-23 | Paper |
Calculation of bounds on variables satisfying nonlinear inequality constraints | 1993-05-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q3996571 | 1992-09-17 | Paper |
Implicitly defined optimization problems | 1992-06-28 | Paper |
Optimization with unary functions | 1991-01-01 | Paper |
The Projective SUMT Method for Convex Programming | 1989-01-01 | Paper |
Second-order sensitivity analysis in factorable programming: Theory and applications | 1988-01-01 | Paper |
Verification of High Order Optimality Conditions Using the Polyadic Representation of Derivatives | 1987-01-01 | Paper |
The polyadic structure of factorable function tensors with applications to high-order minimization techniques | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3677502 | 1983-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3314454 | 1981-01-01 | Paper |
Locating an Isolated Global Minimizer of a Constrained Nonconvex Program | 1980-01-01 | Paper |
Bounding Global Minima with Interval Arithmetic | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3902844 | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3915938 | 1978-01-01 | Paper |
A modification of Armijo's step-size rule for negative curvature | 1977-01-01 | Paper |
Bounding Global Minima | 1976-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4109499 | 1976-01-01 | Paper |
Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems | 1976-01-01 | Paper |
An Arc Method for Nonlinear Programming | 1975-01-01 | Paper |
Alternative proofs of the convergence properties of the conjugate- gradient method | 1974-01-01 | Paper |
Projection method for unconstrained optimization | 1972-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4401740 | 1972-01-01 | Paper |
The Gradient Projection Method under Mild Differentiability Conditions | 1972-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5650216 | 1972-01-01 | Paper |
Methods of conjugate directions versus quasi-Newton methods | 1972-01-01 | Paper |
Penalty function versus non-penalty function methods for constrained nonlinear programming problems | 1971-01-01 | Paper |
The Variable Reduction Method for Nonlinear Programming | 1970-01-01 | Paper |
A Generalization of the Method of Balakrishnan: Inequality Constraints and Initial Conditions | 1970-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5639533 | 1970-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5623522 | 1969-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5668629 | 1969-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5588268 | 1968-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5589755 | 1968-01-01 | Paper |
Second Order Conditions for Constrained Minima | 1967-01-01 | Paper |
The Sequential Unconstrained Minimization Technique (SUMT) Without Parameters | 1967-01-01 | Paper |
The Slacked Unconstrained Minimization Technique for Convex Programming | 1967-01-01 | Paper |
Extensions of SUMT for Nonlinear Programming: Equality Constraints and Extrapolation | 1966-01-01 | Paper |