CFSQP

swMATH4658MaRDI QIDQ16828

No author found.

Related Items (57)

Designing Communication Networks to Decompose Network Control Problems ⋮ Real-Time Inverse Kinematics Techniques for Anthropomorphic Limbs ⋮ Perturbation-based stochastic FE analysis and robust design of inelastic deformation processes ⋮ Unnamed Item ⋮ Comparative Analysis of Some Metaheuristics for Discrete-Continuous Project Scheduling with Activities of Identical Processing Rates ⋮ Proof load designs for estimation of dependence in a bivariate Weibull model ⋮ A theoretical analysis of the cross-nested logit model ⋮ Models and algorithms for optimal piecewise-linear function approximation ⋮ Continuum topology optimization with non-probabilistic reliability constraints based on multi-ellipsoid convex model ⋮ Multiobjective fuzzy linear programming problems with fuzzy decision variables. ⋮ Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization ⋮ A multipurpose parallel genetic hybrid algorithm for nonlinear nonconvex programming problems ⋮ Solving kinematics problems by efficient interval partitioning ⋮ Optimal discretization strategy for boundary element-based shape optimization problem ⋮ A yield function for anisotropic materials application to aluminum alloys. ⋮ Unnamed Item ⋮ A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm ⋮ Consistent Approximations for Optimal Control Problems Based on Runge–Kutta Integration ⋮ Non-probabilistic reliability-based topology optimization of geometrically nonlinear structures using convex models ⋮ Shape optimization of two‐phase inelastic material with microstructure ⋮ Efficient interval partitioning-local search collaboration for constraint satisfaction ⋮ Investigating a hybrid simulated annealing and local search algorithm for constrained optimization ⋮ Advances in metaheuristics for hard optimization ⋮ Unnamed Item ⋮ Discrete-continuous project scheduling with discounted cash flows - a tabu search approach ⋮ Solving 0-1 programming problems by a penalty approach. ⋮ Using Motion Primitives in Probabilistic Sample-Based Planning for Humanoid Robots ⋮ Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation ⋮ Efficient interval partitioning for constrained global optimization ⋮ Maximum Likelihood Set for Estimating a Probability Mass Function ⋮ On solving large-scale finite minimax problems using exponential smoothing ⋮ Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan ⋮ A flexible platform for mixed‐integer non‐linear programming problems ⋮ The use of QP-free algorithm in the limit analysis of slope stability ⋮ Robust design of structures using optimization methods ⋮ Concurrent processing of mixed‐integer non‐linear programming problems ⋮ Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications ⋮ On the use of outer approximations as an external active set strategy ⋮ Least squares estimation techniques for position tracking of radioactive sources ⋮ Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan ⋮ Scalability of the genetic hybrid algorithm on a parallel supercomputer ⋮ Using modeling knowledge to guide design space search ⋮ Sieve Estimation for the Proportional-Odds Failure-Time Regression Model With Interval Censoring ⋮ DistOpt: A software framework for modeling and evaluating optimization problem solutions in distributed environments ⋮ Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints ⋮ Modeling paradigms applied to the analysis of European air quality ⋮ Local search metaheuristics for discrete-continuous scheduling problems ⋮ Unnamed Item ⋮ Feasible direction algorithm for optimal control problems with state and control constraints: Implementation ⋮ Algorithms for optimal signal set design ⋮ Numerical methods for optimal control problems with state constraints ⋮ A concave link elimination (CLE) procedure and lower bound for concave topology, capacity and flow assignment network design problems ⋮ Modulation and coding for noncoherent communications ⋮ Optimal control of the thrusted skate ⋮ A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan ⋮ Tabu list management methods for a discrete-continuous scheduling problem ⋮ Robust design of nonlinear structures using optimization methods

This page was built for software: CFSQP