A quadratically-convergent algorithm for general nonlinear programming problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3206520 (Why is no real title available?)
- scientific article; zbMATH DE number 3270344 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3366716 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Penalty function versus non-penalty function methods for constrained nonlinear programming problems
Cited in
(54)- The Sequential Quadratic Programming Method
- Solution algorithm for an optimistic linear Stackelberg problem
- A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization
- Extension of GAMS for complementarity problems arising in applied economic analysis
- Parametric network utility maximization problem
- Variations and extension of the convex-concave procedure
- Algorithms for nonlinear constraints that use lagrangian functions
- Recent developments in constrained optimization
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- An ADMM-based SQP method for separably smooth nonconvex optimization
- Second- and higher-order duality in nonlinear programming
- A second-order method for the general nonlinear programming problem
- A primal-dual augmented Lagrangian
- On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers
- A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function
- Dual techniques for constrained optimization
- Algorithm 1035: a gradient-based implementation of the polyhedral active set algorithm
- Globally convergent version of Robinson's algorithm for general nonlinear programming problems without using derivatives
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- On a class fo hybrid methods for smooth constrained optimization
- A sequential quadratic programming method for constrained multi-objective optimization problems
- Algorithm 1053: SOLNP+: a derivative-free solver for constrained nonlinear optimization
- Convex optimization approach to a single quadratically constrained quadratic minimization problem
- Minimization methods with constraints
- Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Procedures for optimization problems with a mixture of bounds and general linear constraints
- An exact penalty method with nonmonotone line search and rapid infeasibility detection for constrained multiobjective optimization: application in supervised machine learning
- Quasi-Newtonian methods of constrained optimization
- A sequential method for a class of stable mathematical programming problems
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- A solution method for the optimistic linear semivectorial bilevel optimization problem
- System identification for yield limits and hardening moduli in discrete elastic-plastic structures by nonlinear programming
- Convergence analysis of the semismooth Newton method for sparse control problems governed by semilinear elliptic equations
- Rejoinder on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it
- Analysis and implementation of a dual algorithm for constrained optimization
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it
- Newton-type methods: a broader view
- On the de-facto convex structure of a least square problem for estimating the term structure of interest rates
- A globally convergent algorithm based on imbedding and parametric optimization
- Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization
- Optimal control of antagonistic muscle stiffness during voluntary movements
- On the Pironneau-Polak method of centers
- A partially feasible Jacobi-type distributed SQO method for two-block general linearly constrained smooth optimization
- Lokale konvergenzeigenschaften einer klasse von iterationsverfahren der nichtlinearen optimierung
- A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization
- A globally and quadratically convergent algorithm for general nonlinear programming problems
- Strong metric (sub)regularity of Karush-Kuhn-Tucker mappings for piecewise linear-quadratic convex-composite optimization and the quadratic convergence of Newton's method
- The linearization method
- Newton-type methods for nonlinearly constrained programming problems-algorithms and theory
- A comparative performance evaluation of 27 nonlinear programming codes
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
- A Stabilized Sequential Quadratic Programming Method for Optimization Problems in Function Spaces
This page was built for publication: A quadratically-convergent algorithm for general nonlinear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5682162)
