Nonlinear programming via an exact penalty function: Asymptotic analysis
From MaRDI portal
Publication:3967373
DOI10.1007/BF01585100zbMath0501.90078OpenAlexW2070513764MaRDI QIDQ3967373
Andrew R. Conn, Thomas F. Coleman
Publication date: 1982
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585100
asymptotic analysisglobal methodexact penalty methods2-step superlinear convergencesuccessive quadratic programming approachtheoretic comparison of algorithms
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20)
Related Items
An example of irregular convergence in some constrained optimization methods that use the projected hessian, Properties of a representation of a basis for the null space, Nonlinear programming via an exact penalty function: Global analysis, Penalty functions, Newton's method, and quadratic programming, New simple exact penalty function for constrained minimization, Nonlinear programming without a penalty function or a filter, Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization, A successive quadratic programming algorithm with global and superlinear convergence properties, Global convergence without the assumption of linear independence for a trust-region algorithm for constrained optimization, Augmented Lagrangian nonlinear programming algorithm that uses SQP and trust region techniques, Exact penalty method with integrated consideration of the constraints, Discontinuous piecewise linear optimization, A robust combined trust region–line search exact penalty projected structured scheme for constrained nonlinear least squares, Continuous-time gradient-like descent algorithm for constrained convex unknown functions: penalty method application, A special newton-type optimization method, Nonlinear robust optimization via sequential convex bilevel programming, Using a spectral scaling structured BFGS method for constrained nonlinear least squares, Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares, Combining trust region and linesearch algorithm for equality constrained optimization, Mise à jour de la métrique dans les méthodes de quasi-Newton réduites en optimisation avec contraintes d'égalité, An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems, Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm, On the local and global convergence of a reduced Quasi-Newton method1, The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization, A note on the computation of an orthonormal basis for the null space of a matrix, Global and local convergence of a filter line search method for nonlinear programming, Nonlinear programming and nonsmooth optimization by successive linear programming, A trust region algorithm for constrained optimization, An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization, Operations research and optimization (ORO), A two-step superlinearly convergent projected structured BFGS method for constrained nonlinear least squares, An SQP method for general nonlinear programs using only equality constrained subproblems, An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods, An algorithm for composite nonsmooth optimization problems, Convergent stepsizes for constrained optimization algorithms, Orthogonal and conjugate basis methods for solving equality constrained minimization problems, Local properties of algorithms for minimizing nonsmooth composite functions, Local convergence analysis for the REQP algorithm using conjugate basis matrices, A globally convergent algorithm for nonlinearly constrained optimization problems, Equality and inequality constrained optimization algorithms with convergent stepsizes, Analysis and implementation of a dual algorithm for constrained optimization
Cites Work
- Unnamed Item
- Unnamed Item
- A globally convergent method for nonlinear programming
- On conditions for optimality of the nonlinearl 1 problem
- Second-order conditions for an exact penalty function
- Nonlinear programming via an exact penalty function: Global analysis
- Newton-type methods for unconstrained and linearly constrained optimization
- Quasi-Newton Methods, Motivation and Theory
- A Penalty Function Method Converging Directly to a Constrained Optimum
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- A lower bound for the controlling parameters of the exact penalty functions
- Some examples of cycling in variable metric methods for constrained minimization
- Non-Linear Programming Via Penalty Functions
