The following pages link to Stefano Lucidi (Q240150):
Displayed 50 items.
- Item:Q240150 (redirect page) (← links)
- An application of support vector machines to sales forecasting under promotions (Q330115) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- New global optimization methods for ship design problems (Q374643) (← links)
- A primal-dual algorithm for nonlinear programming exploiting negative curvature directions (Q428494) (← links)
- Analysis of flow cytometric aneuploid DNA histograms: Validation of an automatic procedure against ad hoc experimental data (Q584096) (← links)
- A smooth method for the finite minimax problem (Q689121) (← links)
- An approach to constrained global optimization based on exact penalty functions (Q693136) (← links)
- A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization (Q732778) (← links)
- On the convergence of steepest descent methods for multiobjective optimization (Q782907) (← links)
- An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
- Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function (Q911471) (← links)
- A derivative-free algorithm for systems of nonlinear inequalities (Q941047) (← links)
- Exact penalty functions for nonlinear integer programming problems (Q983724) (← links)
- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds (Q1029281) (← links)
- Global convergence and stabilization of unconstrained minimization methods without derivatives (Q1090237) (← links)
- A new result in the theory and computation of the least-norm solution of a linear program (Q1091260) (← links)
- New results on a class of exact augmented Lagrangians (Q1093533) (← links)
- A truncated Newton method with non-monotone line search for unconstrained optimization (Q1095799) (← links)
- Random tunneling by means of acceptance-rejection sampling for global optimization (Q1106731) (← links)
- A shifted-barrier primal-dual algorithm model for linearly constrained optimization problems (Q1294812) (← links)
- A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set (Q1319684) (← links)
- Nonmonotone bundle-type scheme for convex nonsmooth minimization (Q1321299) (← links)
- On the role of continuously differentiable exact penalty functions in constrained global optimization (Q1330806) (← links)
- Nonmonotone stabilization methods for nonlinear equations (Q1331105) (← links)
- A new version of the Price's algorithm for global optimization (Q1359103) (← links)
- Numerical experiences with new truncated Newton methods in large scale unconstrained optimization (Q1363061) (← links)
- A globally convergent version of the Polak-Ribière conjugate gradient method (Q1366426) (← links)
- Smooth transformation of the generalized minimax problem (Q1372537) (← links)
- Objective-derivative-free methods for constrained optimization (Q1600094) (← links)
- A magnetic resonance device designed via global optimization techniques (Q1764232) (← links)
- An exact augmented Lagrangian function for nonlinear programming with two-sided con\-straints (Q1810969) (← links)
- A truncated Newton method for the solution of large-scale inequality constrained minimization problems (Q1810970) (← links)
- New classes of globally convexized filled functions for global optimization (Q1812075) (← links)
- Nonmonotone curvilinear line search methods for unconstrained optimization (Q1816399) (← links)
- A quasi-discrete Newton algorithm with a nonmonotone stabilization technique (Q1823152) (← links)
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems (Q1897451) (← links)
- Derivative-free methods for bound constrained mixed-integer optimization (Q1928748) (← links)
- An active set feasible method for large-scale minimization problems with bound constraints (Q1928749) (← links)
- An exact penalty global optimization approach for mixed-integer programming problems (Q1940438) (← links)
- A partition-based global optimization algorithm (Q1959242) (← links)
- A derivative-free optimization approach for the autotuning of a forex trading strategy (Q2037890) (← links)
- Cruise itineraries optimal scheduling (Q2037892) (← links)
- A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints (Q2044568) (← links)
- Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient (Q2082555) (← links)
- An augmented Lagrangian method exploiting an active-set strategy and second-order information (Q2139257) (← links)
- Derivative-free methods for mixed-integer nonsmooth constrained optimization (Q2141352) (← links)
- Solving non-monotone equilibrium problems via a DIRECT-type approach (Q2154447) (← links)
- An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables (Q2220918) (← links)
- A class on nonmonotone stabilization methods in unconstrained optimization (Q2277146) (← links)