Pages that link to "Item:Q2719243"
From MaRDI portal
The following pages link to A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm (Q2719243):
Displaying 50 items.
- A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity (Q273251) (← links)
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization (Q393748) (← links)
- Parameter identification in financial market models with a feasible point SQP algorithm (Q429503) (← links)
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052) (← links)
- A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems (Q505808) (← links)
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity (Q556270) (← links)
- Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions (Q597172) (← links)
- A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization (Q627582) (← links)
- The exponentiated generalized inverse Gaussian distribution (Q631562) (← links)
- A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization (Q635233) (← links)
- A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization (Q669396) (← links)
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming (Q693410) (← links)
- A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity (Q833162) (← links)
- A type of efficient feasible SQP algorithms for inequality constrained optimization (Q846474) (← links)
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence (Q848564) (← links)
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q858741) (← links)
- A simple feasible SQP algorithm for inequality constrained optimization (Q858743) (← links)
- A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints (Q861188) (← links)
- A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function (Q939555) (← links)
- A new norm-relaxed SQP algorithm with global convergence (Q972949) (← links)
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization (Q1004010) (← links)
- Multivariate mixed normal conditional heteroskedasticity (Q1019987) (← links)
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
- Abstract model repair for probabilistic systems (Q1706149) (← links)
- An efficient sequential quadratic programming algorithm for nonlinear programming (Q1765487) (← links)
- A feasible interior-point algorithm for nonconvex nonlinear programming (Q1774879) (← links)
- On min-norm and min-max methods of multi-objective optimization (Q1777223) (← links)
- Modeling and forecasting (un)reliable realized covariances for more reliable financial decisions (Q1792481) (← links)
- An interval sequential linear programming for nonlinear robust optimization problems (Q2109530) (← links)
- Minimizing almost smooth control variation in nonlinear optimal control problems (Q2190300) (← links)
- A feasible SQP method for nonlinear programming (Q2266975) (← links)
- Feasible methods for nonconvex nonsmooth problems with applications in green communications (Q2364485) (← links)
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate (Q2370024) (← links)
- Parallel variable distribution algorithm for constrained optimization with nonmonotone technique (Q2375484) (← links)
- A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization (Q2378276) (← links)
- Primal-dual interior point QP-free algorithm for nonlinear constrained optimization (Q2407660) (← links)
- A variant of SQP method for inequality constrained optimization and its global convergence (Q2432728) (← links)
- Improving solver success in reaching feasibility for sets of nonlinear constraints (Q2459379) (← links)
- A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming (Q2462105) (← links)
- A sequential equality constrained quadratic programming algorithm for inequality constrained optimization (Q2475402) (← links)
- Hybrid evolutionary algorithm with Hermite radial basis function interpolants for computationally expensive adjoint solvers (Q2479833) (← links)
- A sequential quadratically constrained quadratic programming method of feasible directions (Q2480785) (← links)
- A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization (Q2510002) (← links)
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q2572648) (← links)
- Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints (Q2692792) (← links)
- A superlinear convergence feasible sequential quadratic programming algorithm for bipedal dynamic walking robot via discrete mechanics and optimal control (Q2835496) (← links)
- A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization (Q2841139) (← links)
- DC Programming and DCA for General DC Programs (Q3192952) (← links)
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization (Q3506289) (← links)
