Add to ORKGThis paper considers a parametric global optimization constrained and unconstrained problem in a real Hilbert space. We suppose that the gradient of the cost functional is Lipschitz continuous but not smooth function. The suitable choice of the parameters implies the linear or superlinear (supergeometric) convengence of the iterative method
This paper is focused on the stability of the optimal value, and its immediate repercussion on the s...
The interface between computer science and operations research has drawn much attention recently esp...
A class of algorithms for nonlinearly constrained optimization problems is proposed. The subproblems...
This paper considers a parametric global optimization constrained and unconstrained problem in a rea...
Abstract. This paper considers constrained and unconstrained parametric global optimization problems...
Summarization: The chapter deals with the parametric linear-convex mathematical programming (MP) pro...
In this paper, we study diagonally scaled gradient methods for simple-bound constrained optimization...
We propose a complete-search algorithm for solving a class of non-convex, possibly infinite-dimensio...
This paper introduces an innovative extension of the DIRECT algorithm specifically designed to solve...
In this paper we consider infinite dimensional optimization problems with equality constraints. The ...
AbstractThis research provides sufficient conditions for Lipschitz continuity and directional differ...
Summarization: The optimization of systems which are described by ordinary differential equations (O...
AbstractWe study properties of the solutions to a parametrized constrained optimization problem in H...
© 2017 Informa UK Limited, trading as Taylor & Francis Group We suggest simple implementable modif...
In this paper, the Lipschitz global optimization problem is considered both in the cases of non-diff...
This paper is focused on the stability of the optimal value, and its immediate repercussion on the s...
The interface between computer science and operations research has drawn much attention recently esp...
A class of algorithms for nonlinearly constrained optimization problems is proposed. The subproblems...
This paper considers a parametric global optimization constrained and unconstrained problem in a rea...
Abstract. This paper considers constrained and unconstrained parametric global optimization problems...
Summarization: The chapter deals with the parametric linear-convex mathematical programming (MP) pro...
In this paper, we study diagonally scaled gradient methods for simple-bound constrained optimization...
We propose a complete-search algorithm for solving a class of non-convex, possibly infinite-dimensio...
This paper introduces an innovative extension of the DIRECT algorithm specifically designed to solve...
In this paper we consider infinite dimensional optimization problems with equality constraints. The ...
AbstractThis research provides sufficient conditions for Lipschitz continuity and directional differ...
Summarization: The optimization of systems which are described by ordinary differential equations (O...
AbstractWe study properties of the solutions to a parametrized constrained optimization problem in H...
© 2017 Informa UK Limited, trading as Taylor & Francis Group We suggest simple implementable modif...
In this paper, the Lipschitz global optimization problem is considered both in the cases of non-diff...
This paper is focused on the stability of the optimal value, and its immediate repercussion on the s...
The interface between computer science and operations research has drawn much attention recently esp...
A class of algorithms for nonlinearly constrained optimization problems is proposed. The subproblems...