Publication:4151662
From MaRDI portal
zbMath0374.65032MaRDI QIDQ4151662
Publication date: 1978
65K05: Numerical mathematical programming methods
Related Items
Symmetric minimum-norm updates for use in gibbs free energy calculations, Higher order derivatives in optimization methods, Trajectory optimization involving sloshing media, A superlinearly convergent method of feasible directions., Nonlinear programming on a microcomputer, Algorithm for solving NLP problems with the use of a modified Lagrange function, Algorithm for solving NLP problems with the use of a modified Lagrange function, A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity, Sequential systems of linear equations method for general constrained optimization without strict complementarity, Augmented Lagrangians which are quadratic in the multiplier, An algorithm for simultaneous magnitude and phase approximation of bivariate rational polynomials, A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization, A simple feasible SQP algorithm for inequality constrained optimization, A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints, Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling, A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization, A globally and superlinearly convergent modified SQP-filter method, An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization, A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function, Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization, Global convergence of a tri-dimensional filter SQP algorithm based on the line search method, A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization, A globally convergent algorithm for nonlinearly constrained optimization problems, An active set RQP algorithm for engineering design optimization, Testing for separable functional structure using temporary equilibrium models, On minimax eigenvalue problems via constrained optimization, Control parametrization: a unified approach to optimal control problems with general constraints, Separation process optimization calculations, ODE versus SQP methods for constrained optimization, Recent developments in constrained optimization, Linearly constrained optimization, Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization, On a Newton-like method for constrained nonlinear minimization via slack variables, Computer experiments on quadratic programming algorithms, A comparative performance evaluation of 27 nonlinear programming codes, Optimality tests for partitioning and sectional search algorithms, The equivalence of an LCP to a parametric linear program with a scalar parameter, A general method for calculating functions of fuzzy numbers, Newton's method and quasi-Newton-SQP method for general \(\text{LC}^1\) constrained optimization, A sequential quadratic programming-based algorithm for the optimization of gas networks, Local convergence analysis for the REQP algorithm using conjugate basis matrices, Nonmonotone line search for minimax problems, An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point, New sequential quadratic programming algorithm with consistent subproblems, A unified approach for parameter identification of inelastic material models in the frame of the finite element method, Parameter identification for finite deformation elasto-plasticity in principal directions, Developments in structural-acoustic optimization for passive noise control, Converting general nonlinear programming problems into separable programming problems with feedforward neural networks., Robust min-max portfolio strategies for rival forecast and risk scenarios, Higher-order derivatives in linear and quadratic programming, An efficient sequential quadratic programming algorithm for nonlinear programming, A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity, Global convergence on an active set SQP for inequality constrained optimization, Computational methods for optimum design of large complex systems, A robust sequential quadratic programming method, Numerical experience with a polyhedral-norm CDT trust-region algorithm, A successive quadratic programming method that uses new corrections for search directions, Nonlinear programming and nonsmooth optimization by successive linear programming, Sparse quadratic programming in chemical process optimization, A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization, A variant of SQP method for inequality constrained optimization and its global convergence, A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming, Optimization in control and learning in coupled map lattice systems, A sequential equality constrained quadratic programming algorithm for inequality constrained optimization, Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems, An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity, A globally and superlinearly convergent feasible QP-free method for nonlinear programming, Process optimization under insufficient experimental information in the phase of service, Use of exact penalty functions to determine efficient decisions, A sequential quadratic programming method for potentially infeasible mathematical programs, Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Revisions of constraint approximations in the successive QP method for nonlinear programming problems, On the convergence of a generalized Reduced gradient algorithm for nonlinear programming problems, On implementation of computational algorithms for optimal design 1: Preliminary investigation, On implementation of computational algorithms for optimal design 2: Extensive numerical investigation, The solution of nonlinear finite element equations, Variable metric methods for minimizing a class of nondifferentiable functions, A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function, An algorithm for unconstrained optimization, A first order, exact penalty function algorithm for equality constrained optimization problems
