A computationally efficient feasible sequential quadratic programming algorithm
From MaRDI portal
Recommendations
- An efficient sequential quadratic programming algorithm for nonlinear programming
- A Feasible Trust-Region Sequential Quadratic Programming Algorithm
- A feasible SQP method for nonlinear programming
- A sequential equality constrained quadratic programming algorithm for inequality constrained optimization
- A feasible equality constrained SQP algorithm for nonlinear optimization
Cited in
(71)- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
- Multivariate mixed normal conditional heteroskedasticity
- An SQP algorithm with cautious updating criteria for nonlinear degenerate problems
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- Experiments with successive quadratic programming algorithms
- Abstract model repair for probabilistic systems
- An efficient sequential quadratic programming algorithm for nonlinear programming
- A feasible interior-point algorithm for nonconvex nonlinear programming
- On min-norm and min-max methods of multi-objective optimization
- Modeling and forecasting (un)reliable realized covariances for more reliable financial decisions
- An interval sequential linear programming for nonlinear robust optimization problems
- Minimizing almost smooth control variation in nonlinear optimal control problems
- A feasible SQP method for nonlinear programming
- Feasible methods for nonconvex nonsmooth problems with applications in green communications
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
- Parallel variable distribution algorithm for constrained optimization with nonmonotone technique
- A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
- Primal-dual interior point QP-free algorithm for nonlinear constrained optimization
- A variant of SQP method for inequality constrained optimization and its global convergence
- Improving solver success in reaching feasibility for sets of nonlinear constraints
- A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming
- A sequential equality constrained quadratic programming algorithm for inequality constrained optimization
- Hybrid evolutionary algorithm with Hermite radial basis function interpolants for computationally expensive adjoint solvers
- A sequential quadratically constrained quadratic programming method of feasible directions
- A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints
- A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity
- A superlinear convergence feasible sequential quadratic programming algorithm for bipedal dynamic walking robot via discrete mechanics and optimal control
- A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization
- DC programming and DCA for general DC programs
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- Inverse determination of kinetic rate constants for transesterification of vegetable oils
- Estimation of time varying skewness and kurtosis with an application to value at risk
- scientific article; zbMATH DE number 3963585 (Why is no real title available?)
- scientific article; zbMATH DE number 3965826 (Why is no real title available?)
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- Parameter identification in financial market models with a feasible point SQP algorithm
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
- Feasibility refinement in sequential quadratic programming using parametric sensitivity analysis
- scientific article; zbMATH DE number 7009452 (Why is no real title available?)
- A Feasible Trust-Region Sequential Quadratic Programming Algorithm
- scientific article; zbMATH DE number 2155131 (Why is no real title available?)
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
- A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem
- A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems
- A new trust region–sequential quadratic programming approach for nonlinear systems based on nonlinear model predictive control
- A new SQP approach for nonlinear complementarity problems
- A coupled complex boundary method for an inverse conductivity problem with one measurement
- A robust implementation of a sequential quadratic programming algorithm with successive error restoration
- An active set sequential quadratic programming algorithm for nonlinear optimisation
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- Local feasible QP-free algorithms for the constrained minimization of SC^1 functions
- Spatiotemporal vaccine allocation policies for epidemics with behavioral feedback dynamics
- A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization
- The exponentiated generalized inverse Gaussian distribution
- A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
- Modeling Covid-19 contagion dynamics: time-series analysis across different countries and subperiods
- A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization
- Semi-analytical guidance for velocity maximization of gliding vehicles using proportional navigation and sparse waypoints
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming
- Simpson's paradox for Kendall's rank coefficient
- DualBi: a dual bisection algorithm for non-convex problems with a scalar complicating constraint
- A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity
- A type of efficient feasible SQP algorithms for inequality constrained optimization
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A simple feasible SQP algorithm for inequality constrained optimization
- A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints
- A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function
- A new norm-relaxed SQP algorithm with global convergence
This page was built for publication: A computationally efficient feasible sequential quadratic programming algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2719243)
