An algorithm for solving linearly constrained optimization problems is proposed. The search direction is computed by a bundle principle and the constraints are treated through an active set strategy. Difficulties that arise when the objective function is nonsmooth require a clever choice of a constraint to relax. A certain nondegeneracy assumption is necessary to obtain convergence
In this article we present an algorithm for solving bound constrained optimization problems without ...
In this paper, we propose new linesearch-based methods for nonsmooth constrained optimization proble...
A new active-set method for smooth box-constrained minimization is introduced. The algorithm combin...
SIGLECNRS RS 14802 E / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
In this paper, we describe a new active-set algorithmic framework for minimizing a non-convex functi...
In this paper, we describe a two-stage method for solving optimization problems with bound constrain...
We propose a numerical algorithm for solving smooth nonlinear programming problems with a large numb...
AbstractThe paper suggests a new implementation of the active set method for solving linear programm...
A method for linearly constrained optimization which modifies and generalizes recent box-constraint ...
summary:We employ the active set strategy which was proposed by Facchinei for solving large scale bo...
This paper describes an active-set algorithm for large-scale nonlinear programming based on the succ...
We are concerned with the solution of the bound constrained minimization problem {minf(x), la parts ...
Bundle methods for Nondifferentiable Optimization are widely recognised as one of the best choices f...
Nonsmooth convex optimization problems with two blocks of variables subject to linear constraints ar...
126 pagesOptimization and variational problems typically involve a highly structured blend of smooth...
In this article we present an algorithm for solving bound constrained optimization problems without ...
In this paper, we propose new linesearch-based methods for nonsmooth constrained optimization proble...
A new active-set method for smooth box-constrained minimization is introduced. The algorithm combin...
SIGLECNRS RS 14802 E / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
In this paper, we describe a new active-set algorithmic framework for minimizing a non-convex functi...
In this paper, we describe a two-stage method for solving optimization problems with bound constrain...
We propose a numerical algorithm for solving smooth nonlinear programming problems with a large numb...
AbstractThe paper suggests a new implementation of the active set method for solving linear programm...
A method for linearly constrained optimization which modifies and generalizes recent box-constraint ...
summary:We employ the active set strategy which was proposed by Facchinei for solving large scale bo...
This paper describes an active-set algorithm for large-scale nonlinear programming based on the succ...
We are concerned with the solution of the bound constrained minimization problem {minf(x), la parts ...
Bundle methods for Nondifferentiable Optimization are widely recognised as one of the best choices f...
Nonsmooth convex optimization problems with two blocks of variables subject to linear constraints ar...
126 pagesOptimization and variational problems typically involve a highly structured blend of smooth...
In this article we present an algorithm for solving bound constrained optimization problems without ...
In this paper, we propose new linesearch-based methods for nonsmooth constrained optimization proble...
A new active-set method for smooth box-constrained minimization is introduced. The algorithm combin...
DOI
Add to ORKG