A globally convergent method for nonlinear programming
From MaRDI portal
Publication:1229804
DOI10.1007/BF00932858zbMath0336.90046MaRDI QIDQ1229804
Publication date: 1977
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
90C30: Nonlinear programming
41A60: Asymptotic approximations, asymptotic expansions (steepest descent, etc.)
Related Items
Solving nonlinear programming problems with very many constraints, Théorie de la pénalisation exacte, The linearization method, Second order methods for solving extremum problems form optimal linar regression design, Finite penalty methods with a linear approximation of the constraints. I, Finite penalty methods with a linear approximation of the constraints. I, A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity, A globalization scheme for the generalized Gauss-Newton method, Sequential penalty algorithm for nonlinear constrained optimization, The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis, The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. II. An efficient implementation with linear least squares subproblems, The kidney model as an inverse problem, A trust region method with a conic model for nonlinearly 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, Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function, On-line optimization of gas pipeline networks, Vertical slot fishways: Mathematical modeling and optimal management, A quadratically approximate framework for constrained optimization, global and local convergence, Convergent stepsizes for constrained optimization algorithms, A quadratic approximation method for minimizing a class of quasidifferentiable functions, A globally convergent algorithm for nonlinearly constrained optimization problems, An active set RQP algorithm for engineering design optimization, On minimax eigenvalue problems via constrained optimization, Penalty functions, Newton's method, and quadratic programming, A sparse sequential quadratic programming algorithm, Control parametrization: a unified approach to optimal control problems with general constraints, Separation process optimization calculations, Numerical comparisons of nonlinear programming algorithms on serial and vector processors using automatic differentiation, Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization, A robust secant method for optimization problems with inequality constraints, Steplength algorithms for minimizing a class of nondifferentiable functions, Enlarging the region of convergence of Newton's method for constrained optimization, A globally convergent algorithm for exact penalty functions, Globally convergent methods for semi-infinite programming, A recursive quadratic programming algorithm for semi-infinite optimization problems, An algorithm for solving linearly constrained minimax problems, A least-distance programming procedure for minimization problems under linear constraints, Sequential quadratic programming for certain parameter identification problems, Successive linearization methods for large-scale nonlinear programming problems, An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems, Complete decomposition algorithm for nonconvex separable optimization problems and applications, A new successive quadratic programming algorithm, A quasi-Newton method for estimating the parameter in a nonlinear hyperbolic system, A reduced Hessian method for constrained optimization, Orthogonal and conjugate basis methods for solving equality constrained minimization problems, On a class fo hybrid methods for smooth constrained optimization, New minimax algorithm, Equality and inequality constrained optimization algorithms with convergent stepsizes, A recursive quadric programming algorithm that uses new nondifferentiable penalty functions, A two-parameter exact penalty function for nonlinear programming, New sequential quadratic programming algorithm with consistent subproblems, A global convergence theory for an active-trust-region algorithm for solving the general nonlinear programing problem., Experimental complexity analysis of continuous constraint satisfaction problems., 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, Iterative bundle-based decomposition for large-scale nonseparable convex optimization, Nonmonotone line search algorithm for constrained minimax problems, Computational methods for optimum design of large complex systems, On solving three classes of nonlinear programming problems via simple differentiable penalty functions, A robust sequential quadratic programming method, A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method, Exact barrier function methods for Lipschitz programs, A generalized gradient projection method for optimization problems with equality and inequality constraints about arbitrary initial point, Exact penalty function algorithm with simple updating of the penalty parameter, On combining feasibility, descent and superlinear convergence in inequality constrained optimization, An SQP-type algorithm for nonlinear second-order cone programs, A trust-region method by active-set strategy for general nonlinear optimization, Optimization in control and learning in coupled map lattice systems, A sequential quadratically constrained quadratic programming method of feasible directions, An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity, A modified Newton method for constrained estimation in covariance structure analysis, Use of exact penalty functions to determine efficient decisions, A sequential quadratic programming method for potentially infeasible mathematical programs, An analysis of reduced Hessian methods for constrained optimization, Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization, Use of a finite penalty in convex programming problems for global convergence of Newton's method with steep adjustment, Optimal control of robotic manipulators in the presence of obstacles, A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization, Revisions of constraint approximations in the successive QP method for nonlinear programming problems, A projected lagrangian algorithm for semi-infinite programming, Exact penalty functions and stability in locally Lipschitz programming, A successive quadratic programming algorithm with global and superlinear convergence properties, A recursive quadratic programming algorithm that uses differentiable exact penalty functions, Eine global and lokal überlineare knovergente regularisierung des wilson-vergahrens, A two-stage feasible directions algorithm for nonlinear constrained optimization, Matrix criterion robust linear quadratic control problem, Mise à jour de la métrique dans les méthodes de quasi-Newton réduites en optimisation avec contraintes d'égalité, On the local and global convergence of a reduced Quasi-Newton method1, Exact penalty functions in nonlinear programming, Second-order conditions for an exact penalty function, Variable metric methods for minimizing a class of nondifferentiable functions, Finite-difference gradients versus error-quadrature gradients in the solution of parameterized optimal control problems, 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, Superlinearly convergent variable metric algorithms for general nonlinear programming problems, A first order, exact penalty function algorithm for equality constrained optimization problems, Some examples of cycling in variable metric methods for constrained minimization, A quasi-newton method for minimum trace factor analysis, A sequential quadratic programming algorithm for nonlinear minimax problems, An active set sequential quadratic programming algorithm for nonlinear optimisation, Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming
Cites Work
- Stability of the solution of definite quadratic programs
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Dual Variable Metric Algorithms for Constrained Optimization
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Unnamed Item
- Unnamed Item
