Publication:3915937
From MaRDI portal
zbMath0464.65042MaRDI QIDQ3915937
Publication date: 1978
unconstrained optimization; rate of convergence; numerical results; variable metric methods; Lagrangian function
Related Items
Generalised monotone line search algorithm for degenerate nonlinear minimax problems, A superlinearly convergent method of feasible directions., An exact penalty function algorithm for semi-infinite programmes, The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis, The kidney model as an inverse problem, A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints, The convergence of matrices generated by rank-2 methods from the restricted \(\beta\)-class of Broyden, An algorithm for composite nonsmooth optimization problems, Convergent stepsizes for constrained optimization algorithms, A quadratic approximation method for minimizing a class of quasidifferentiable functions, An active set RQP algorithm for engineering design optimization, Numerical comparisons of nonlinear programming algorithms on serial and vector processors using automatic differentiation, On a Newton-like method for constrained nonlinear minimization via slack variables, Enlarging the region of convergence of Newton's method for constrained optimization, An algorithm for solving linearly constrained minimax problems, A trust region algorithm for equality constrained optimization, The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients, An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems, New minimax algorithm, A two-parameter exact penalty function for nonlinear programming, A generalized projection-successive linear equations algorithm for nonlinearly equality and inequality constrained optimization and its rate of convergence, A new SQP method of feasible directions for nonlinear programming., Working range optimization for turbine and compressor blading, A superlinearly and quadratically convergent SQP type feasible method for constrained optimization, A rank-one fitting algorithm for unconstrained optimization problems., Global convergence on an active set SQP for inequality constrained optimization, Local convergence analysis for partitioned quasi-Newton updates, A successive quadratic programming method that uses new corrections for search directions, Unification of basic and composite nondifferentiable optimization, On combining feasibility, descent and superlinear convergence in inequality constrained optimization, Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints, A new superlinearly convergent SQP algorithm for nonlinear minimax problems, The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization, Mathematical programming models and algorithms for engineering design optimization, An analysis of reduced Hessian methods for constrained optimization, Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization, Multilevel least-change Newton-like methods for equality constrained optimization problems, The convergence of variable metric matrices in unconstrained optimization, An only 2-step Q-superlinear convergence example for some algorithms that use reduced hessian approximations, Local properties of algorithms for minimizing nonsmooth composite functions, An example of irregular convergence in some constrained optimization methods that use the projected hessian, A successive quadratic programming algorithm with global and superlinear convergence properties, A recursive quadratic programming algorithm that uses differentiable exact penalty functions, Mise à jour de la métrique dans les méthodes de quasi-Newton réduites en optimisation avec contraintes d'égalité, Exact penalty functions in nonlinear programming, A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function, A dual differentiable exact penalty function, Nonlinear programming via an exact penalty function: Asymptotic analysis
