Cited in
(76)- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- A theoretical analysis of the cross-nested logit model
- Generation of acoustic solitary waves in a lattice of Helmholtz resonators
- A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- Mesoscopic modeling of stochastic reaction-diffusion kinetics in the subdiffusive regime
- Choquet-based optimisation in multiobjective shortest path and spanning tree problems
- Aggregate subgradient method for nonsmooth DC optimization
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- A new sequential optimality condition for constrained nonsmooth optimization
- Efficient algorithms for calculation of shear stress amplitude and amplitude of the second invariant of the stress deviator in fatigue criteria applications
- Generalized sensitivity analysis of the minimal model of the intravenous glucose tolerance test
- Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
- Recent progress in log-concave density estimation
- Maximum likelihood estimation of a multi-dimensional log-concave density. With discussion and authors' reply
- Diffusive approximation of a time-fractional Burger's equation in nonlinear acoustics
- Wave propagation in a fractional viscoelastic Andrade medium: diffusive approximation and numerical modeling
- Imposing contiguity constraints in political districting models
- Subgradient and bundle methods for nonsmooth optimization
- A DFO technique to calibrate queueing models
- scientific article; zbMATH DE number 1306973 (Why is no real title available?)
- On the global minimum in a balanced circular packing problem
- An operational measure for squeezing
- SOCP
- NDA
- DONLP2
- BIOGEME
- UFO
- FFSQP(f77)
- GradSamp
- SLQP-GS
- NSO
- DGM
- PBNCGC
- PNEW
- QSM
- LDGB
- LogConcDEAD
- logconcens
- logcondens
- MPBNGC
- K_TREE/K_SUBGRAPH
- MINMOD
- logcondens.mode
- ralgb4
- ralgb5
- logcondiscr
- scar
- GRANSO
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- Determining six cardiac conductivities from realistically large datasets
- Approach to solving the inverse problem of filtration based on descriptive regularization
- An implementation of a reduced subgradient method via Luenberger-Mokhtar variant
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
- PyOpt: a python-based object-oriented framework for nonlinear constrained optimization
- An augmented penalty function method with penalty parameter updates for nonconvex optimization
- Design of robust stable controls for nonlinear objects
- Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality
- Comparing different nonsmooth minimization methods and software
- Certificates of infeasibility via nonsmooth optimization
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- 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
- Wave simulation in 2D heterogeneous transversely isotropic porous media with fractional attenuation: a Cartesian grid approach
- Reverse propagation of McCormick relaxations
- Inference and modeling with log-concave distributions
- On N. Z. Shor's three scientific ideas
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
- Conjugate gradient type methods for the nondifferentiable convex minimization
- Invariant sets for families of linear and nonlinear discrete systems with bounded disturbances
- Using a sensitivity study to facilitate the design of a multi-electrode array to measure six cardiac conductivity values
- Theory and software implementations of Shor's r-algorithms
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
This page was built for software: SolvOpt
