PLCP
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Global convergence of quasi-Newton methods based on adjoint Broyden updates
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- Properties of equation reformulation of the Karush-Kuhn-Tucker condition for nonlinear second order cone optimization problems
- Hilbert class library
- QPCOMP
- Stand_and_Adapt_Bend
- SNDlib
- Numerical optimization. Theoretical and practice aspects
- The volume algorithm revisited: relation with bundle methods
- SPECY
- Optimizing parameters in clinical trials with a randomized start or withdrawal design
- Global optimal power flow over large-scale power transmission networks
- AIM@SHAPE
- SIMEM3 Renault
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
- SolvOpt
- Probabilistic optimization via approximate \(p\)-efficient points and bundle methods
- Sufficient dimension reduction using Hilbert-Schmidt independence criterion
- A modified hybrid genetic algorithm for solving nonlinear optimal control problems
- On the local convergence analysis of the gradient sampling method for finite max-functions
- Global optimization for optimal power flow over transmission networks
- UFO
- An improved 2D MoF method by using high order derivatives
- DSPCA
- Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems
- DDSIP
- A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines
- Inverse problem for a class of nonlinear elliptic equations with entropy solution
- SQPlab
- SLQP-GS
- Large-scale unit commitment under uncertainty: an updated literature survey
- GradSamp
- HANSO
- A feasible point method with bundle modification for nonsmooth convex constrained optimization
- A fast gradient and function sampling method for finite-max functions
- Modelling and parameter identification for a nonlinear time-delay system in microbial batch fermentation
- Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study
- Bundle relaxation and primal recovery in unit commitment problems. The Brazilian case
- PNEW
- DGM
- QSM
- A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach
- sIPOPT
- LSMM
- LDGB
- ABAQUS/Explicit
- Dual norm based iterative methods for image restoration
- The Josephy-Newton method for semismooth generalized equations and semismooth SQP for optimization
- Regularization methods for optimization problems with probabilistic constraints
- Self-concordant analysis for logistic regression
- Modified firefly algorithm
- DEGEN
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
- Global optimization of multilevel electricity market models including network design and graph partitioning
- A novel high-order functional based image registration model with inequality constraint
- Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions
- Interactive model-based search for global optimization
- A Newton solver for micromorphic computational homogenization enabling multiscale buckling analysis of pattern-transforming metamaterials
- A posteriori estimates distinguishing the error components and adaptive stopping criteria for numerical approximations of parabolic variational inequalities
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
- A three-term recurrence relation for accurate evaluation of transition probabilities of the simple birth-and-death process
- A unified framework for high-order numerical discretizations of variational inequalities
- ZQPCVX
- On the stabilization of singular identification problem of an unknown discontinuous diffusion parameter in elliptic equation
- Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers
- A feasibility-ensured Lagrangian heuristic for general decomposable problems
- Risk-averse stochastic programming and distributionally robust optimization via operator splitting
- A new restricted memory level bundle method for constrained convex nonsmooth optimization
- SABRINA: a stochastic subspace majorization-minimization algorithm
- Hybrid global search algorithm with genetic blocks for solving hexamatrix games
- Revisiting augmented Lagrangian duals
- A quantum genetic algorithm for optimization problems on the Bloch sphere
- A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization
- Multi-phase algorithm design for accurate and efficient model fitting
- Primal superlinear convergence of SQP methods in piecewise linear-quadratic composite optimization
- On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game
- A primal-dual algorithm for risk minimization
- Physics constrained learning for data-driven inverse modeling from sparse observations
- Nonlinear optimization of district heating networks
- Optimal control of nonlinear fractional-order systems with multiple time-varying delays
- A sliding window algorithm for energy distribution system with storage
- A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements
- A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem
- A gradient-type algorithm for constrained optimization with application to microstructure optimization
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization
- Topology optimization design of stretchable metamaterials with Bézier skeleton explicit density (BSED) representation algorithm
- A class of Benders decomposition methods for variational inequalities
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring
- Superlinear convergence of the sequential quadratic method in constrained optimization
- A proximal interior point algorithm with applications to image processing
- Properties of the sign gradient descent algorithms
- Automating the design of tokamak experiment scenarios
- Synchronisation and control of proliferation in cycling cell population models with age structure
- A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming
- SAMCEF
- Optimization algorithms for parameter identification in parabolic partial differential equations
- Fully smoothed _1-TV models: bounds for the minimizers and parameter choice
- Newton-type methods: a broader view
- Robust static super-replication of barrier options
- Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
This page was built for software: PLCP
