Free Material Optimization with Fundamental Eigenfrequency Constraints.

The goal of this paper is to formulate and solve free material optimization problems with constraints on the smallest eigenfrequency of the optimal structure. A natural formulation of this problem as linear semidefinite program turns out to be numerically intractable. As an alternative, we propose a new approach, which is based on a nonlinear semidefinite … Read more

A Logarithmic-Quadratic Proximal Point Scalarization Method for Multiobjective Programming

We present a proximal point method to solve multiobjective problems based on the scalarization for maps. We build a family of a convex scalar strict representation of a convex map F with respect to the lexicographic order on Rm and we add a variant of the logarithmquadratic regularization of Auslender, where the unconstrained variables in … Read more

The opportunistic replacement problem: analysis and case studies

We consider an optimization model for determining optimal opportunistic maintenance (that is, component replacement) schedules when data is deterministic. This problem generalizes that of Dickman, Epstein, and Wilamowsky [21] and is a natural starting point for the modelling of replacement schedules when component lives are non-deterministic. We show that this basic opportunistic replacement problem is … Read more

An interior point algorithm for nonlinear minimax problems

We present a primal-dual interior point method for constrained nonlinear, discrete minimax problems where the objective functions and constraints are not necessarily convex. The algorithm uses two merit functions to ensure progress towards the points satisfying the first order optimality conditions of the original problem. Convergence properties are described and numerical results provided. CitationDept. of … Read more

A Nonstandard Simplex Algorithm for Linear Programming

The simplex algorithm travels, on the underlying polyhedron, from vertex to vertex until reaching an optimal vertex. With the same simplex framework, the proposed algorithm generates a series of feasible points (which are not necessarily vertices). In particular, it is exactly an interior point algorithm if the initial point used is interior. Computational experiments show … Read more

On the Optimal On-Line Management of Photovoltaic-Hydrogen Hybrid Energy Systems

We present an on-line management strategy for photovoltaic-hydrogen (PV-H2) hybrid energy systems. The strategy follows a receding-horizon principle and exploits solar radiation forecasts and statistics generated through a Gaussian process model. We demonstrate that incorporating forecast information can dramatically improve the reliability and economic performance of these promising energy production devices. ArticleDownload View PDF

Nuclear norm minimization for the planted clique and biclique problems

We consider the problems of finding a maximum clique in a graph and finding a maximum-edge biclique in a bipartite graph. Both problems are NP-hard. We write both problems as matrix-rank minimization and then relax them using the nuclear norm. This technique, which may be regarded as a generalization of compressive sensing, has recently been … Read more

Generic identifiability and second-order sufficiency in tame convex optimization

We consider linear optimization over a fixed compact convex feasible region that is semi-algebraic (or, more generally, “tame”). Generically, we prove that the optimal solution is unique and lies on a unique manifold, around which the feasible region is “partly smooth”, ensuring finite identification of the manifold by many optimization algorithms. Furthermore, second-order optimality conditions … Read more

Optimality conditions for several type of efficient solutions of set-valued optimization problems

A simple unified framework is presented for the study of strong efficient solutions, weak efficient solutions, positive proper efficient solutions, Henig global proper efficient solutions, Henig proper efficient solutions, super efficient solutions, Benson proper efficient solutions, Hartley proper efficient solutions, Hurwicz proper efficient solutions and Borwein proper efficient solutions of set-valued optimization problem with/or without … Read more

Identifying Activity

Identification of active constraints in constrained optimization is of interest from both practical and theoretical viewpoints, as it holds the promise of reducing an inequality-constrained problem to an equality-constrained problem, in a neighborhood of a solution. We study this issue in the more general setting of composite nonsmooth minimization, in which the objective is a … Read more