Journal: Computational Optimization and Applications

Found 579 papers in total
Evaluating bound‐constrained minimization software
2012,
Bound‐constrained minimization is a subject of active research. To assess the...
Active‐set Newton methods for mathematical programs with vanishing constraints
2012,
Mathematical programs with vanishing constraints constitute a new class of difficult...
Approximate values for mathematical programs with variational inequality constraints
2012,
In general the infimal value of a mathematical program with variational inequality...
Convergence analysis of a proximal Gauss‐Newton method
2012,
An extension of the Gauss‐Newton algorithm is proposed to find local minimizers...
Strong duality and minimal representations for cone optimization
2012,
The elegant theoretical results for strong duality and strict complementarity for...
Gap functions and penalization for solving equilibrium problems with nonlinear constraints
2012,
The paper deals with equilibrium problems (EPs) with nonlinear convex constraints....
On the convergence of trust region algorithms for unconstrained minimization without derivatives
2012,
We consider iterative trust region algorithms for the unconstrained minimization of an...
Margin maximization in spherical separation
2012,
We face the problem of strictly separating two sets of points by means of a sphere,...
An active set feasible method for large‐scale minimization problems with bound constraints
2012,
We are concerned with the solution of the bound constrained minimization problem {min...
An intermodal multicommodity routing problem with scheduled services
2012,
We study a multicommodity routing problem faced by an intermodal service operator that...
An inexact spectral bundle method for convex quadratic semidefinite programming
2012,
We present an inexact spectral bundle method for solving convex quadratic semidefinite...
A measure space approach to optimal source placement
2012,
The problem of optimal placement of point sources is formulated as a distributed...
Updating the regularization parameter in the adaptive cubic regularization algorithm
2012,
The adaptive cubic regularization method (Cartis et al., 2011, 2011) has been recently...
Edge‐based semidefinite programming relaxation of sensor network localization with lower bound constraints
2012,
In this paper, we strengthen the edge‐based semidefinite programming relaxation...
The nearest point problem in a polyhedral set and its extensions
2012,
In this paper we investigate the relationship between the nearest point problem in a...
A multi‐swarm PSO using charged particles in a partitioned search space for continuous optimization
2012,
Particle swarm optimization (PSO) is characterized by a fast convergence, which can...
Balanced POD for linear PDE robust control computations
2012,
A mathematical model of a physical system is never perfect; therefore, robust control...
Relaxed cutting plane method with convexification for solving nonlinear semi‐infinite programming problems
2012,
In this paper, we present an algorithm to solve nonlinear semi‐infinite...
A general theorem on error estimates with application to a quasilinear elliptic optimal control problem
2012,
A theorem on error estimates for smooth nonlinear programming problems in Banach...
Convergence of the forward‐backward sweep method in optimal control
2012,
The Forward‐Backward Sweep Method is a numerical technique for solving optimal...
A hybrid ODE‐based method for unconstrained optimization problems
2012,
This paper presents a hybrid ODE‐based method for unconstrained optimization...
Numerical approximation of elliptic control problems with finitely many pointwise constraints
2012,
We study the numerical approximation of elliptic control problems with finitely many...
Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
2012,
At each outer iteration of standard Augmented Lagrangian methods one tries to solve a...
A combinatorial optimization algorithm for solving the branchwidth problem
2012,
In this paper, we consider the problem of computing an optimal branch decomposition of...
Papers per page: