Pages that link to "Item:Q2897297"
From MaRDI portal
The following pages link to Sequential Quadratic Programming Methods (Q2897297):
Displaying 29 items.
- Computing the nearest low-rank correlation matrix by a simplified SQP algorithm (Q299647) (← links)
- A stabilized SQP method: superlinear convergence (Q526843) (← links)
- Combining stabilized SQP with the augmented Lagrangian algorithm (Q887169) (← links)
- Solving linear optimization over arithmetic constraint formula (Q1675635) (← links)
- An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming (Q1949595) (← links)
- How to measure uncertainty in uncertainty sampling for active learning (Q2127220) (← links)
- An adaptively regularized sequential quadratic programming method for equality constrained optimization (Q2244236) (← links)
- Newton-type methods: a broader view (Q2260691) (← links)
- Methods for convex and general quadratic programming (Q2356335) (← links)
- Variations and extension of the convex-concave procedure (Q2358020) (← links)
- Convergence of a stabilized SQP method for equality constrained optimization (Q2419576) (← links)
- Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints (Q2692792) (← links)
- BO-B\&B: a hybrid algorithm based on Bayesian optimization and branch-and-bound for discrete network design problems (Q2699090) (← links)
- Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs (Q2806813) (← links)
- Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework (Q2943830) (← links)
- An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming (Q2945128) (← links)
- The Sequential Quadratic Programming Method (Q3569505) (← links)
- Qualification Conditions in Semialgebraic Programming (Q4571881) (← links)
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints (Q4631819) (← links)
- A Regularized Factorization-Free Method for Equality-Constrained Optimization (Q4641674) (← links)
- A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results (Q5058375) (← links)
- (Q5226082) (← links)
- A stochastic control approach to Slotted-ALOHA random access protocol (Q5253000) (← links)
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs (Q5501232) (← links)
- A Predictor-Corrector Path-Following Algorithm for Dual-Degenerate Parametric Optimization Problems (Q5737719) (← links)
- Space-Time Galerkin POD with Application in Optimal Control of Semilinear Partial Differential Equations (Q5745138) (← links)
- An adaptive stochastic sequential quadratic programming with differentiable exact augmented Lagrangians (Q6038658) (← links)
- A novel multidimensional penalty‐free approach for constrained optimal control of switched control systems (Q6061845) (← links)
- Dimensionality reduction for regularization of sparse data-driven RANS simulations (Q6078483) (← links)
