A surperlinearly convergent algorithm for constrained optimization problems
From MaRDI portal
Cited in
(72)- On the local convergence of a penalty-function-free SQP method
- A sequential equality constrained quadratic programming algorithm for inequality constrained optimization
- Nonmonotone line search algorithm for constrained minimax problems
- Mise à jour de la métrique dans les méthodes de quasi-Newton réduites en optimisation avec contraintes d'égalité
- An SQP method for general nonlinear programs using only equality constrained subproblems
- Feasible direction algorithm for optimal control problems with state and control constraints: Implementation
- Wing aerodynamic optimization using efficient mathematically-extracted modal design variables
- Global convergence of inexact reduced sqp methods
- A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity
- A modified SQP algorithm for minimax problems
- A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity
- Partitioned quasi-Newton methods for nonlinear equality constrained optimization
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
- A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization
- Nonlinear programming without a penalty function or a filter
- Superlinearly convergent algorithm for min-max problems
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- Numerical experiments in semi-infinite programming
- Computer-aided design via optimization: A review
- Decentralized Cooperative Optimization for Multi-criteria Decision Making
- A method for constrained multiobjective optimization based on SQP techniques
- Equality and inequality constrained optimization algorithms with convergent stepsizes
- A new superlinearly convergent SQP algorithm for nonlinear minimax problems
- A globally and superlinearly convergent feasible QP-free method for nonlinear programming
- An exact penalty function method with global convergence properties for nonlinear programming problems
- Global and local convergence of a filter line search method for nonlinear programming
- Second-order conditions for an exact penalty function
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems
- A superlinearly convergent numerical algorithm for nonlinear programming
- A globally convergent algorithm for nonlinearly constrained optimization problems
- An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point
- A globalization scheme for the generalized Gauss-Newton method
- An adaptively regularized sequential quadratic programming method for equality constrained optimization
- A successive quadratic programming algorithm with global and superlinear convergence properties
- A generalized projection-successive linear equations algorithm for nonlinearly equality and inequality constrained optimization and its rate of convergence
- Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
- Sequential quadratic programming with step control using the Lagrange function
- A new SQP method of feasible directions for nonlinear programming.
- A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations
- On the local and global convergence of a reduced Quasi-Newton method1
- Smoothed penalty algorithms for optimization of nonlinear models
- Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization
- Preface
- A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity
- An efficient sequential quadratic programming algorithm for nonlinear programming
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- A superlinearly convergent hybrid algorithm for solving nonlinear programming
- A successive quadratic programming method that uses new corrections for search directions
- A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization
- Nonmonotone line search for minimax problems
- An exact penalty function algorithm for semi-infinite programmes
- A sequential quadratic programming algorithm for nonlinear minimax problems
- Exact penalty function algorithm with simple updating of the penalty parameter
- An overview of nonlinear optimization
- An analysis of reduced Hessian methods for constrained optimization
- Parameter optimization using the L_ exact penalty function and strictly convex quadratic programming problems
- A two-parameter exact penalty function for nonlinear programming
- Switching stepsize strategies for sequential quadratic programming
- An adaptive smoothing method for continuous minimax problems
- Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function
- Convergent stepsizes for constrained optimization algorithms
- An integral transform approach to cross-variograms modeling
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
- A penalty-free method with superlinear convergence for equality constrained optimization
- An infeasible active-set QP-free algorithm for general nonlinear programming
- A feasible and superlinear algorithm for inequality constrained minimization problems
- Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
- Generalized monotone line search SQP algorithm for constrained minimax problems
- Subspace methods for nonlinear optimization
This page was built for publication: A surperlinearly convergent algorithm for constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3934161)
