A robust sequential quadratic programming method
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- scientific article; zbMATH DE number 3422206 (Why is no real title available?)
- A Gauss-Newton Approach to Solving Generalized Inequalities
- A globally convergent method for nonlinear programming
- A lower bound for the controlling parameters of the exact penalty functions
- A model algorithm for composite nondifferentiable optimization problems
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- APPROXIMATIVE PROPERTIES OF SETS IN NORMED LINEAR SPACES
- Algorithms for nonlinear constraints that use lagrangian functions
- Descent methods for composite nondifferentiable optimization problems
- Exact penalty functions in nonlinear programming
- On conditions to have bounded multipliers in locally lipschitz programming
- Optimization and nonsmooth analysis
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Projected gradient methods for linearly constrained problems
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
Cited in
(77)- A decoupling approach for time-dependent robust optimization with application to power semiconductor devices
- On the numerical modeling of convex particle assemblies with friction
- On detecting degenerate stationarity
- A new successive quadratic programming algorithm
- A modified sequential quadratic programming method for nonlinear programming
- An interval sequential linear programming for nonlinear robust optimization problems
- A kind of nonmonotone filter method for nonlinear complementarity problem
- A trust region SQP-filter method for nonlinear second-order cone programming
- On the augmented subproblems within sequential methods for nonlinear programming
- A feasible SQP method for nonlinear programming
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- Equality and inequality constrained optimization algorithms with convergent stepsizes
- An interior point method for nonlinear programming with infeasibility detection capabilities
- A variant of SQP method for inequality constrained optimization and its global convergence
- scientific article; zbMATH DE number 4066630 (Why is no real title available?)
- A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization
- A second-derivative SQP method with a `trust-region-free' predictor step
- A line search exact penalty method using steering rules
- An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point
- Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
- A globally and superlinearly convergent modified SQP-filter method
- On sequential approximate simultaneous analysis and design in classical topology optimization
- Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
- Exact barrier function methods for Lipschitz programs
- Dynamics and phase coordination of multi-module vibration-driven locomotion robots with linear or nonlinear connections
- Sequential penalty algorithm for nonlinear constrained optimization
- An exact penalty method for nonconvex problems covering, in particular, nonlinear programming, semidefinite programming, and second-order cone programming
- A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
- A robust SQP method based on a smoothing lower order penalty function†
- Augmented Lagrangian methods for the solution of generalized Nash equilibrium problems
- A modified SQP method and its global convergence
- A sequential quadratic programming method for constrained multi-objective optimization problems
- A SQP method for inequality constrained optimization.
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
- Global convergence of a robust filter SQP algorithm
- A modified SQP-filter method and its global convergence
- A successive quadratic programming method that uses new corrections for search directions
- Augmented Lagrangian and exact penalty methods for quasi-variational inequalities
- A modified SQP method with nonmonotone technique and its global convergence
- A robust algorithm for quadratic optimization under quadratic constraints
- A feasible filter SQP algorithm with global and local convergence
- An inequality constrained nonlinear Kalman-Bucy smoother by interior point likelihood maximization
- A new result on second-order necessary conditions for nonlinear programming
- Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
- A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming
- Parameter optimization using the L_ exact penalty function and strictly convex quadratic programming problems
- Error bounds and finite termination for constrained optimization problems
- Analysis and implementation of a dual algorithm for constrained optimization
- Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization
- Convergence rate for diminishing stepsize methods in nonconvex constrained optimization via ghost penalties
- Switching stepsize strategies for sequential quadratic programming
- Global convergence on an active set SQP for inequality constrained optimization
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective
- A globally convergent SQP-type method with least constraint violation for nonlinear semidefinite programming
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
- Ghost penalties in nonconvex constrained optimization: diminishing stepsizes and iteration complexity
- New sequential quadratic programming algorithm with consistent subproblems
- A new technique for inconsistent QP problems in the SQP method
- scientific article; zbMATH DE number 4121777 (Why is no real title available?)
- Penalty functions, Newton's method, and quadratic programming
- A restoration-free filter SQP algorithm for equality constrained optimization
- Some new facts about sequential quadratic programming methods employing second derivatives
- Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming
- An infeasible active-set QP-free algorithm for general nonlinear programming
- A smoothing QP-free infeasible method for nonlinear inequality constrained optimization
- A sequential quadratic programming method for potentially infeasible mathematical programs
- Level constrained first order methods for function constrained optimization
- A robust SQP method for mathematical programs with linear complementarity constraints
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
- A robust implementation of a sequential quadratic programming algorithm with successive error restoration
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- Inexact sequential quadratic optimization with penalty parameter updates within the QP solver
- Sequential quadratic optimization for nonlinear optimization problems on Riemannian manifolds
- Implementation of a robust SQP algorithm
This page was built for publication: A robust sequential quadratic programming method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825141)
