The following pages link to SQPlab (Q17301):
Displayed 50 items.
- Sufficient dimension reduction using Hilbert-Schmidt independence criterion (Q1658374) (← links)
- A modified hybrid genetic algorithm for solving nonlinear optimal control problems (Q1664734) (← links)
- On the local convergence analysis of the gradient sampling method for finite max-functions (Q1682976) (← links)
- Global optimization for optimal power flow over transmission networks (Q1683333) (← links)
- A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines (Q1728470) (← links)
- Inverse problem for a class of nonlinear elliptic equations with entropy solution (Q1729219) (← links)
- Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
- A feasible point method with bundle modification for nonsmooth convex constrained optimization (Q1753350) (← links)
- A fast gradient and function sampling method for finite-max functions (Q1756577) (← links)
- Modelling and parameter identification for a nonlinear time-delay system in microbial batch fermentation (Q1788978) (← links)
- A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach (Q1849498) (← links)
- Dual norm based iterative methods for image restoration (Q1932971) (← links)
- The Josephy-Newton method for semismooth generalized equations and semismooth SQP for optimization (Q1938516) (← links)
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods (Q1986106) (← links)
- Global optimization of multilevel electricity market models including network design and graph partitioning (Q2010915) (← links)
- A novel high-order functional based image registration model with inequality constraint (Q2012916) (← links)
- Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions (Q2013149) (← links)
- Interactive model-based search for global optimization (Q2018506) (← links)
- A Newton solver for micromorphic computational homogenization enabling multiscale buckling analysis of pattern-transforming metamaterials (Q2020909) (← links)
- A posteriori estimates distinguishing the error components and adaptive stopping criteria for numerical approximations of parabolic variational inequalities (Q2021152) (← links)
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions (Q2023656) (← links)
- A three-term recurrence relation for accurate evaluation of transition probabilities of the simple birth-and-death process (Q2026365) (← links)
- A unified framework for high-order numerical discretizations of variational inequalities (Q2027637) (← links)
- On the stabilization of singular identification problem of an unknown discontinuous diffusion parameter in elliptic equation (Q2047583) (← links)
- Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers (Q2057229) (← links)
- A feasibility-ensured Lagrangian heuristic for general decomposable problems (Q2068837) (← links)
- Risk-averse stochastic programming and distributionally robust optimization via operator splitting (Q2070402) (← links)
- A new restricted memory level bundle method for constrained convex nonsmooth optimization (Q2080833) (← links)
- SABRINA: a stochastic subspace majorization-minimization algorithm (Q2095568) (← links)
- Hybrid global search algorithm with genetic blocks for solving hexamatrix games (Q2097315) (← links)
- Revisiting augmented Lagrangian duals (Q2097636) (← links)
- A quantum genetic algorithm for optimization problems on the Bloch sphere (Q2102252) (← links)
- A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization (Q2104108) (← links)
- Multi-phase algorithm design for accurate and efficient model fitting (Q2115821) (← links)
- Primal superlinear convergence of SQP methods in piecewise linear-quadratic composite optimization (Q2116019) (← links)
- On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game (Q2117635) (← links)
- A primal-dual algorithm for risk minimization (Q2133418) (← links)
- Physics constrained learning for data-driven inverse modeling from sparse observations (Q2135255) (← links)
- Nonlinear optimization of district heating networks (Q2139138) (← links)
- Optimal control of nonlinear fractional-order systems with multiple time-varying delays (Q2139285) (← links)
- A sliding window algorithm for energy distribution system with storage (Q2142782) (← links)
- A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements (Q2146977) (← links)
- 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 (Q2175368) (← links)
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization (Q2177698) (← links)
- Topology optimization design of stretchable metamaterials with Bézier skeleton explicit density (BSED) representation algorithm (Q2184482) (← links)
- A class of Benders decomposition methods for variational inequalities (Q2191798) (← links)
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
- Superlinear convergence of the sequential quadratic method in constrained optimization (Q2198525) (← links)
- A proximal interior point algorithm with applications to image processing (Q2203368) (← links)
- Properties of the sign gradient descent algorithms (Q2214992) (← links)