The following pages link to PLCP (Q16957):
Displaying 50 items.
- Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization (Q975356) (← links)
- Incremental-like bundle methods with application to energy planning (Q975362) (← links)
- Switching systems: active mode recognition, identification of the switching law (Q983325) (← links)
- A cascade optimization methodology for automatic parameter identification and shape/process optimization in metal forming simulation (Q996650) (← links)
- Global convergence of quasi-Newton methods based on adjoint Broyden updates (Q1012254) (← links)
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences (Q1016107) (← links)
- Properties of equation reformulation of the Karush-Kuhn-Tucker condition for nonlinear second order cone optimization problems (Q1040684) (← links)
- Numerical optimization. Theoretical and practice aspects (Q1369896) (← links)
- The volume algorithm revisited: relation with bundle methods (Q1396813) (← links)
- Optimizing parameters in clinical trials with a randomized start or withdrawal design (Q1615177) (← links)
- Global optimal power flow over large-scale power transmission networks (Q1624891) (← links)
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization (Q1644014) (← links)
- Probabilistic optimization via approximate \(p\)-efficient points and bundle methods (Q1652036) (← links)
- 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)
- An improved 2D MoF method by using high order derivatives (Q1695345) (← links)
- Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems (Q1706415) (← 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)
- Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study (Q1789594) (← links)
- Bundle relaxation and primal recovery in unit commitment problems. The Brazilian case (Q1810824) (← 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)
- Regularization methods for optimization problems with probabilistic constraints (Q1949268) (← links)
- Self-concordant analysis for logistic regression (Q1952060) (← links)
- Modified firefly algorithm (Q1952854) (← 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)
