FSQP

swMATH4114MaRDI QIDQ16301FDOQ16301

Author name not available (Why is that?)

Cited In (36)

• A parallel algorithm for semi-infinite programming
• Title not available (Why is that?)
• Extracting structure from optical flow using the fast error search technique
• An Explicit Exchange Algorithm For Linear Semi-Infinite Programming Problems With Second-Order Cone Constraints
• Nonmonotone line search algorithm for constrained minimax problems
• Wing aerodynamic optimization using efficient mathematically-extracted modal design variables
• The direct solution of nonconvex nonlinear FIR filter design problems by a SIP method
• A sufficient and necessary condition for nonconvex constrained optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• An optimal control approach to nonlinear mixed integer programming problems
• Nonlinear Lagrangian theory for nonconvex optimization.
• An interior point algorithm for continuous minimax: implementation and computation
• A parametric procedure for ultrametric tree estimation from conditional rank order proximity data
• Under-estimates of reachable sets for linear control systems
• Discretization in semi-infinite programming: the rate of convergence
• Lebesgue constant minimizing linear rational interpolation of continuous functions over the interval
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• Order-restricted inference for monotone trend alternatives in contingency tables.
• Title not available (Why is that?)
• The control parameterization enhancing transform for constrained optimal control problems
• A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming
• A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming
• An \(L_ 1\) smoothing spline algorithm with cross validation
• A methodology for multi-objective design assessment and flight control synthesis tuning
• Numerical solution of dynamic optimization problems using parametrization and \(\text{Op}^{\text{ti}}\text{A}\) software
• A smoothing Newton method for semi-infinite programming
• Title not available (Why is that?)
• A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
• A computationally efficient feasible sequential quadratic programming algorithm
• A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems
• Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
• On the magneto-elastic properties of elastomer-ferromagnet composites
• LOWLAD: A locally weighted \(L_ 1\) smoothing spline algorithm with cross validated choice of smoothing parameters
• An iterative method for solving KKT system of the semi-infinite programming
• Random Effects Modeling of Multiple Binomial Responses Using the Multivariate Binomial Logit‐Normal Distribution

This page was built for software: FSQP