The following pages link to FSQP (Q16301):
Displaying 36 items.
- A parallel algorithm for semi-infinite programming (Q956770) (← links)
- Order-restricted inference for monotone trend alternatives in contingency tables. (Q1275097) (← links)
- An \(L_ 1\) smoothing spline algorithm with cross validation (Q1315221) (← links)
- Lebesgue constant minimizing linear rational interpolation of continuous functions over the interval (Q1356869) (← links)
- A sufficient and necessary condition for nonconvex constrained optimization (Q1376773) (← links)
- A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming (Q1433470) (← links)
- A smoothing Newton method for semi-infinite programming (Q1777435) (← links)
- Wing aerodynamic optimization using efficient mathematically-extracted modal design variables (Q1787330) (← links)
- An optimal control approach to nonlinear mixed integer programming problems (Q1806583) (← links)
- Nonmonotone line search algorithm for constrained minimax problems (Q1812065) (← links)
- Extracting structure from optical flow using the fast error search technique (Q1859628) (← links)
- LOWLAD: A locally weighted \(L_ 1\) smoothing spline algorithm with cross validated choice of smoothing parameters (Q1893530) (← links)
- A parametric procedure for ultrametric tree estimation from conditional rank order proximity data (Q1901372) (← links)
- Under-estimates of reachable sets for linear control systems (Q1905810) (← links)
- Numerical solution of dynamic optimization problems using parametrization and \(\text{Op}^{\text{ti}}\text{A}\) software (Q1923346) (← links)
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization (Q2368081) (← links)
- A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems (Q2435607) (← links)
- A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming (Q2462105) (← links)
- A computationally efficient feasible sequential quadratic programming algorithm (Q2719243) (← links)
- (Q3146237) (← links)
- An iterative method for solving KKT system of the semi-infinite programming (Q3369516) (← links)
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization (Q3506289) (← links)
- (Q3535023) (← links)
- An Explicit Exchange Algorithm For Linear Semi-Infinite Programming Problems With Second-Order Cone Constraints (Q3586147) (← links)
- An interior point algorithm for continuous minimax: implementation and computation (Q3605208) (← links)
- (Q3840143) (← links)
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates (Q4018616) (← links)
- The control parameterization enhancing transform for constrained optimal control problems (Q4243937) (← links)
- (Q4309371) (← links)
- Random Effects Modeling of Multiple Binomial Responses Using the Multivariate Binomial Logit‐Normal Distribution (Q4668376) (← links)
- A methodology for multi-objective design assessment and flight control synthesis tuning (Q4700796) (← links)
- (Q5503154) (← links)
- Nonlinear Lagrangian theory for nonconvex optimization. (Q5942347) (← links)
- Discretization in semi-infinite programming: the rate of convergence (Q5955561) (← links)
- On the magneto-elastic properties of elastomer-ferromagnet composites (Q5958035) (← links)
- The direct solution of nonconvex nonlinear FIR filter design problems by a SIP method (Q5958048) (← links)
