The following pages link to F. Rinaldi (Q246831):
Displaying 50 items.
- (Q340010) (redirect page) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- Continuous reformulations for zero-one programming problems (Q415420) (← links)
- A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares (Q480935) (← links)
- Path loss prediction in urban environment using learning machines and dimensionality reduction techniques (Q645503) (← links)
- An approach to constrained global optimization based on exact penalty functions (Q693136) (← links)
- An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
- New results on the equivalence between zero-one programming and continuous concave programming (Q839801) (← links)
- Exact penalty functions for nonlinear integer programming problems (Q983724) (← links)
- Concave programming for minimizing the zero-norm over polyhedral sets (Q989849) (← links)
- A patient adaptable ECG beat classifier based on neural networks (Q1030240) (← links)
- A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization (Q1704920) (← links)
- Pure infection-immunization dynamics for partnership games: a correction (Q1735820) (← links)
- Derivative-free methods for bound constrained mixed-integer optimization (Q1928748) (← links)
- An exact penalty global optimization approach for mixed-integer programming problems (Q1940438) (← links)
- Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient (Q2082555) (← links)
- An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations (Q2111473) (← links)
- Avoiding bad steps in Frank-Wolfe variants (Q2111475) (← links)
- Derivative-free methods for mixed-integer nonsmooth constrained optimization (Q2141352) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- Improved penalty algorithm for mixed integer PDE constrained optimization problems (Q2147266) (← 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)
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods (Q2240671) (← links)
- Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method (Q2257078) (← links)
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
- Derivative-free robust optimization for circuit design (Q2342134) (← links)
- A derivative-free algorithm for constrained global optimization based on exact penalty functions (Q2342135) (← links)
- Derivative-free methods for mixed-integer constrained optimization problems (Q2342138) (← links)
- Derivative-free global ship design optimization using global/local hybridization of the DIRECT algorithm (Q2357973) (← links)
- A two-stage active-set algorithm for bound-constrained optimization (Q2359771) (← links)
- A DIRECT-type approach for derivative-free constrained global optimization (Q2397821) (← links)
- Feasibility Pump-like heuristics for mixed integer problems (Q2448898) (← links)
- A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations (Q2515062) (← links)
- A fast active set block coordinate descent algorithm for \(\ell_1\)-regularized least squares (Q2796799) (← links)
- A feasible active set method with reoptimization for convex quadratic mixed-integer programming (Q2817838) (← links)
- A new class of functions for measuring solution integrality in the feasibility pump approach (Q2866198) (← links)
- A concave optimization-based approach for sparse portfolio selection (Q2905343) (← links)
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization (Q2934466) (← links)
- Concave programming for finding sparse solutions to problems with convex constraints (Q3096890) (← links)
- A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization (Q3179268) (← links)
- Feature selection combining linear support vector machines and concave optimization (Q3562388) (← links)
- A Derivative-Free Method for Structured Optimization Problems (Q4987276) (← links)
- Fast Cluster Detection in Networks by First Order Optimization (Q5065475) (← links)
- A General Regularized Continuous Formulation for the Maximum Clique Problem (Q5108235) (← links)
- Total Variation Based Community Detection Using a Nonlinear Optimization Approach (Q5113808) (← links)
- Active Set Complexity of the Away-Step Frank--Wolfe Algorithm (Q5124005) (← links)
- Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions (Q5203798) (← links)
- First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants (Q5233104) (← links)
- A derivative-free approach for a simulation-based optimization problem in healthcare (Q5963228) (← links)
