The following pages link to Luis Nunes Vicente (Q839811):
Displaying 49 items.
- On the optimal order of worst case complexity of direct search (Q276315) (← links)
- Analysis of direct searches for discontinuous functions (Q431012) (← links)
- Globally convergent evolution strategies (Q494335) (← links)
- Updating the multipliers associated with inequality constraints in an augmented Lagrangian multiplier method (Q597168) (← links)
- Estimation of risk-neutral density surfaces (Q645506) (← links)
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization (Q715240) (← links)
- Worst case complexity of direct search (Q743632) (← links)
- Implicitly and densely discrete black-box optimization problems (Q839812) (← links)
- Multicriteria approach to bilevel optimization (Q868587) (← links)
- Globally convergent evolution strategies for constrained optimization (Q887166) (← links)
- Incorporating minimum Frobenius norm models in direct search (Q975361) (← links)
- (Q1315415) (redirect page) (← links)
- (Q245491) (redirect page) (← links)
- (Q1405547) (redirect page) (← links)
- A new technique for generating quadratic programming test problems (Q1315416) (← links)
- On the solution and complexity of a generalized linear complementarity problem (Q1327430) (← links)
- Descent approaches for quadratic bilevel programming (Q1331096) (← links)
- Bilevel and multilevel programming: A bibliography review (Q1338535) (← links)
- Space mapping: models, sensitivities, and trust-regions methods (Q1405548) (← links)
- Characterization of the smoothness and curvature of a marginal function for a trust-region problem. (Q1572665) (← links)
- Local convergence of the affine-scaling interior-point algorithm for nonlinear programming (Q1588839) (← links)
- An indicator for the switch from derivative-free to derivative-based optimization (Q1728260) (← links)
- Generation of disjointly constrained bilinear programming test problems (Q1803651) (← links)
- Local convergence of a primal-dual method for degenerate nonlinear programming (Q1812091) (← links)
- Local analysis of a new multipliers method (Q1848393) (← links)
- A globally convergent primal-dual interior-point filter method for nonlinear programming (Q1881567) (← links)
- Discrete linear bilevel programming problem (Q1918022) (← links)
- Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization (Q1935888) (← links)
- Inexact solution of NLP subproblems in MINLP (Q1942026) (← links)
- Accuracy and fairness trade-offs in machine learning: a stochastic multi-objective approach (Q2090124) (← links)
- Globally convergent DC trust-region methods (Q2250078) (← links)
- A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds (Q2288191) (← links)
- A parallel evolution strategy for an Earth imaging problem in geophysics (Q2357955) (← links)
- Direct search based on probabilistic feasible descent for bound and linearly constrained problems (Q2419520) (← links)
- A particle swarm pattern search method for bound constrained global optimization (Q2454725) (← links)
- Recovering risk-neutral probability density functions from options prices using cubic splines and ensuring nonnegativity (Q2463504) (← links)
- Geometry of interpolation sets in derivative free optimization (Q2467163) (← links)
- (Q2779489) (← links)
- Analysis of Inexact Trust-Region SQP Algorithms (Q2784412) (← links)
- A second-order globally convergent direct-search method and its worst-case complexity (Q2810113) (← links)
- Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case (Q2826817) (← links)
- Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization (Q2841063) (← links)
- Bilevel derivative-free optimization and its application to robust optimization (Q2885495) (← links)
- Convergence of Trust-Region Methods Based on Probabilistic Models (Q2934477) (← links)
- Efficient Cardinality/Mean-Variance Portfolios (Q2950096) (← links)
- Direct Multisearch for Multiobjective Optimization (Q3105792) (← links)
- Generating Linear and Linear-Quadratic Bilevel Programming Problems (Q3140139) (← links)
- Levenberg--Marquardt Methods Based on Probabilistic Gradient Models and Inexact Subproblem Solution, with Application to Data Assimilation (Q3179313) (← links)
- PSwarm: a hybrid solver for linearly constrained global derivative-free optimization (Q3396391) (← links)
- Direct Search Based on Probabilistic Descent (Q5502242) (← links)
- Convergence rates of the stochastic alternating algorithm for bi-objective optimization (Q6108978) (← links)
