SolvOpt

swMATH4332MaRDI QIDQ16511

No author found.

Described by source

• An implementation of Shor's \(r\)-algorithm

Related Items (50)

Comparing different nonsmooth minimization methods and software ⋮ On the global minimum in a balanced circular packing problem ⋮ Using a sensitivity study to facilitate the design of a multi-electrode array to measure six cardiac conductivity values ⋮ Generalized sensitivity analysis of the minimal model of the intravenous glucose tolerance test ⋮ Wave simulation in 2D heterogeneous transversely isotropic porous media with fractional attenuation: a Cartesian grid approach ⋮ A theoretical analysis of the cross-nested logit model ⋮ Choquet-based optimisation in multiobjective shortest path and spanning tree problems ⋮ Imposing Contiguity Constraints in Political Districting Models ⋮ Certificates of infeasibility via nonsmooth optimization ⋮ On N. Z. Shor's three scientific ideas ⋮ PyOpt: a python-based object-oriented framework for nonlinear constrained optimization ⋮ A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization ⋮ Linear adaptive control for nonstationary uncertain systems under bounded noise ⋮ On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems ⋮ Generation of acoustic solitary waves in a lattice of Helmholtz resonators ⋮ Determining six cardiac conductivities from realistically large datasets ⋮ Conjugate gradient type methods for the nondifferentiable convex minimization ⋮ The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches ⋮ A New Sequential Optimality Condition for Constrained Nonsmooth Optimization ⋮ Inference and modeling with log-concave distributions ⋮ Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions ⋮ An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems ⋮ An augmented penalty function method with penalty parameter updates for nonconvex optimization ⋮ Wave propagation in a fractional viscoelastic Andrade medium: diffusive approximation and numerical modeling ⋮ Recent progress in log-concave density estimation ⋮ Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality ⋮ Constrained nonconvex nonsmooth optimization via proximal bundle method ⋮ Reverse propagation of McCormick relaxations ⋮ Theory and software implementations of Shor's \(r\)-algorithms ⋮ Unnamed Item ⋮ Aggregate subgradient method for nonsmooth DC optimization ⋮ Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates ⋮ Exact algorithms for OWA-optimization in multiobjective spanning tree problems ⋮ Invariant sets for families of linear and nonlinear discrete systems with bounded disturbances ⋮ A DFO technique to calibrate queueing models ⋮ Design of robust stable controls for nonlinear objects ⋮ Mesoscopic Modeling of Stochastic Reaction-Diffusion Kinetics in the Subdiffusive Regime ⋮ An implementation of a reduced subgradient method via Luenberger-Mokhtar variant ⋮ Diagonal discrete gradient bundle method for derivative free nonsmooth optimization ⋮ Approach to solving the inverse problem of filtration based on descriptive regularization ⋮ Diffusive Approximation of a Time-Fractional Burger's Equation in Nonlinear Acoustics ⋮ An operational measure for squeezing ⋮ Subgradient and Bundle Methods for Nonsmooth Optimization ⋮ A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems ⋮ Maximum Likelihood Estimation of a Multi-Dimensional Log-Concave Density ⋮ Efficient algorithms for calculation of shear stress amplitude and amplitude of the second invariant of the stress deviator in fatigue criteria applications ⋮ Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems ⋮ Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints ⋮ Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization ⋮ A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations

This page was built for software: SolvOpt