Superlinearly convergent variable metric algorithms for general nonlinear programming problems
From MaRDI portal
Publication:4139993
Cites work
- scientific article; zbMATH DE number 3474862 (Why is no real title available?)
- scientific article; zbMATH DE number 3543799 (Why is no real title available?)
- scientific article; zbMATH DE number 3438636 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3312380 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3423824 (Why is no real title available?)
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives
- A New Algorithm for Unconstrained Optimization
- A Rapidly Convergent Descent Method for Minimization
- A general saddle point result for constrained optimization
- A globally convergent method for nonlinear programming
- A quadratically-convergent algorithm for general nonlinear programming problems
- Dual Variable Metric Algorithms for Constrained Optimization
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- Newton-type methods for unconstrained and linearly constrained optimization
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Variable Metric Method for Minimization
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
- Variable metric methods of minimisation
Cited in
(only showing first 100 items - show all)- A numerically stable dual method for solving strictly convex quadratic programs
- A type of efficient feasible SQP algorithms for inequality constrained optimization
- Globally convergent methods for semi-infinite programming
- An augmented Lagrangian trust region method for equality constrained optimization
- Some examples of cycling in variable metric methods for constrained minimization
- A quadratic approximation method for minimizing a class of quasidifferentiable functions
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- A robust sequential quadratic programming method
- Solving nonlinear programming problems with very many constraints
- Equality and inequality constrained optimization algorithms with convergent stepsizes
- Optimal fleet allocation of freeway service patrols
- Iterative linear programming solution of convex programs
- A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function
- A successive quadratic programming algorithm with global and superlinear convergence properties
- A linear programming-based optimization algorithm for solving nonlinear programming problems
- The ESA NLP solver WORHP
- A modified QP-free feasible method
- Algorithms for nonlinear constraints that use lagrangian functions
- Partitioned quasi-Newton methods for nonlinear equality constrained optimization
- A recursive quadratic programming algorithm for semi-infinite optimization problems
- A projected gradient and constraint linearization method for nonlinear model predictive control
- Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function
- Augmented Lagrangians which are quadratic in the multiplier
- Generalized monotone line search SQP algorithm for constrained minimax problems
- Procedures for optimization problems with a mixture of bounds and general linear constraints
- Control parametrization: a unified approach to optimal control problems with general constraints
- A sequential equality constrained quadratic programming algorithm for inequality constrained optimization
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
- The linearization method
- Variable metric methods for minimizing a class of nondifferentiable functions
- A globally convergent method for nonlinear programming
- Computational methods for optimum design of large complex systems
- Exact penalty functions in nonlinear programming
- A multi-objective approach to the design of low thrust space trajectories using optimal control
- An active set RQP algorithm for engineering design optimization
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints
- A factorization with update procedures for a KKT matrix arising in direct optimal control
- A globally and superlinearly convergent feasible QP-free method for nonlinear programming
- Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms
- A two-stage feasible directions algorithm for nonlinear constrained optimization
- An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems
- On minimax eigenvalue problems via constrained optimization
- Dual techniques for constrained optimization
- Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
- A new SQP method of feasible directions for nonlinear programming.
- A superlinearly convergent numerical algorithm for nonlinear programming
- Discrete mechanics and optimal control: An analysis
- An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point
- An analysis of reduced Hessian methods for constrained optimization
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Convergent stepsizes for constrained optimization algorithms
- A family of the local convergence of the improved secant methods for nonlinear equality constrained optimization subject to bounds on variables
- On Secant Updates for Use in General Constrained Optimization
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- A recursive quadratic programming algorithm that uses differentiable exact penalty functions
- On the local convergence of a penalty-function-free SQP method
- Properties of updating methods for the multipliers in augmented Lagrangians
- Hybrid functions of Bernstein polynomials and block-pulse functions for solving optimal control of the nonlinear Volterra integral equations
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- An algorithm for solving linearly constrained minimax problems
- Switching stepsize strategies for sequential quadratic programming
- An efficient sequential quadratic programming algorithm for nonlinear programming
- A globally convergent Newton method for convex \(SC^ 1\) minimization problems
- A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints
- A heuristic algorithm for nonlinear programming
- Sequential penalty algorithm for nonlinear constrained optimization
- A modified SQP-filter method and its global convergence
- A modified SQP method and its global convergence
- A penalty-function-free line search SQP method for nonlinear programming
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations
- Limited memory quasi-Newton method for large-scale linearly equality-constrained minimization
- A Lagrange-Newton algorithm for sparse nonlinear programming
- A globally and superlinearly convergent modified SQP-filter method
- A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization
- A class of superlinearly convergent projection algorithms with relaxed stepsizes
- A method of centers algorithm for certain minimax problems
- On the use of adjoint gradients for time-optimal control problems regarding a discrete control parameterization
- Multilevel least-change Newton-like methods for equality constrained optimization problems
- Second order methods for solving extremum problems form optimal linar regression design
- Discrete LQR and ILQR methods based on high order Runge-Kutta discretizations
- Alternative regularizations for outer-approximation algorithms for convex MINLP
- Sequential quadratic optimization for stochastic optimization with deterministic nonlinear inequality and equality constraints
- New sequential quadratic programming algorithm with consistent subproblems
- Newton's method and quasi-Newton-SQP method for general \(\text{LC}^1\) constrained optimization
- Sparse quadratic programming in chemical process optimization
- A sequential quadratic programming-based algorithm for the optimization of gas networks
- Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization
- A globally convergent version of a general recursive algorithm for nonlinear programming
- A feasible and superlinear algorithm for inequality constrained minimization problems
- A dual differentiable exact penalty function
- First- and second-order optimality conditions of nonsmooth sparsity multiobjective optimization via variational analysis
- A robust secant method for optimization problems with inequality constraints
- YAM2: yet another library for the \(M_2\) variables using sequential quadratic programming
- A sparse sequential quadratic programming algorithm
- A projected Newton method for minimization problems with nonlinear inequality constraints
This page was built for publication: Superlinearly convergent variable metric algorithms for general nonlinear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4139993)
