Inexact restoration (IR) is a well established technique for continuous minimization problems with constraints that can be applied to constrained optimization problems with specific structures. When some variables are restricted to be integer, an IR strategy seems to be appropriate. The IR strategy employs a restoration procedure in which one solves a standard nonlinear programming problem and an optimization procedure in which the constraints are linearized and techniques for mixed-integer (linear or quadratic) programming can be employed
This discussion focuses on the constrained optimization problem and looks into different methods for...
A derivative-free optimization method is proposed for solving a general nonlinear programming proble...
International audienceResearchers from interval analysis and constraint (logic) programming communit...
Inexact restoration (IR) is a well established technique for continuous minimization problems with c...
Inexact restoration (IR) is a well established technique for continuous minimization problems with c...
A new iterative algorithm based on the inexact-restoration (IR) approach combined with the filter st...
A new iterative algorithm based on the inexact-restoration (IR) approach combined with the filter st...
A new method is introduced for large scale convex constrained optimization. The general model algor...
Optimization problems with many more inequality constraints than variables arise in support-vector m...
The problem of minimizing a function f(x) subject to the constraint r(x) s is considered. Here, f i...
A new method is introduced for minimizing a function that can be computed only inexactly, with diffe...
The purpose of this work is to present an algorithm to solve nonlinear constrained optimization prob...
This article describes the current state of the art of interior-point methods (IPMs)for convex, coni...
A new inexact-restoration method for nonlinear programming is introduced. The iteration of the main ...
Mathematical Program with Complementarity Constraints (MPCC) finds application in many fields. As th...
This discussion focuses on the constrained optimization problem and looks into different methods for...
A derivative-free optimization method is proposed for solving a general nonlinear programming proble...
International audienceResearchers from interval analysis and constraint (logic) programming communit...
Inexact restoration (IR) is a well established technique for continuous minimization problems with c...
Inexact restoration (IR) is a well established technique for continuous minimization problems with c...
A new iterative algorithm based on the inexact-restoration (IR) approach combined with the filter st...
A new iterative algorithm based on the inexact-restoration (IR) approach combined with the filter st...
A new method is introduced for large scale convex constrained optimization. The general model algor...
Optimization problems with many more inequality constraints than variables arise in support-vector m...
The problem of minimizing a function f(x) subject to the constraint r(x) s is considered. Here, f i...
A new method is introduced for minimizing a function that can be computed only inexactly, with diffe...
The purpose of this work is to present an algorithm to solve nonlinear constrained optimization prob...
This article describes the current state of the art of interior-point methods (IPMs)for convex, coni...
A new inexact-restoration method for nonlinear programming is introduced. The iteration of the main ...
Mathematical Program with Complementarity Constraints (MPCC) finds application in many fields. As th...
This discussion focuses on the constrained optimization problem and looks into different methods for...
A derivative-free optimization method is proposed for solving a general nonlinear programming proble...
International audienceResearchers from interval analysis and constraint (logic) programming communit...