82,744 research outputs found
Efficient handling of stability problems in shell optimization by asymmetric ‘worst-case’ shape imperfection
The paper presents an approach to shape optimization of proportionally loaded elastic shell structures under stability constraints. To reduce the stability-related problems, a special technique is utilized, by which the response analysis is always terminated before the first critical point is reached. In this way, the optimization is always related to a precritical structural state. The necessary load-carrying capability of the optimal structure is assured by extending the usual formulation of the optimization problem by a constraint on an estimated critical load factor. Since limit points are easier to handle, the possible presence of bifurcation points is avoided by introducing imperfection parameters. They are related to an asymmetric shape perturbation of the structure. During the optimization, the imperfection parameters are updated to get automatically the ‘worst-case’ pattern and amplitude of the imperfection. Both, the imperfection parameters and the design variables are related to the structural shape via the design element technique. A gradient-based optimizer is employed to solve the optimization problem. Three examples illustrate the proposed approach. Copyright © 2007 John Wiley & Sons, Ltd
Second-order subdifferential calculus with applications to tilt stability in optimization
The paper concerns the second-order generalized differentiation theory of
variational analysis and new applications of this theory to some problems of
constrained optimization in finitedimensional spaces. The main attention is
paid to the so-called (full and partial) second-order subdifferentials of
extended-real-valued functions, which are dual-type constructions generated by
coderivatives of frst-order subdifferential mappings. We develop an extended
second-order subdifferential calculus and analyze the basic second-order
qualification condition ensuring the fulfillment of the principal secondorder
chain rule for strongly and fully amenable compositions. The calculus results
obtained in this way and computing the second-order subdifferentials for
piecewise linear-quadratic functions and their major specifications are applied
then to the study of tilt stability of local minimizers for important classes
of problems in constrained optimization that include, in particular, problems
of nonlinear programming and certain classes of extended nonlinear programs
described in composite terms
Differentially Private Convex Optimization with Piecewise Affine Objectives
Differential privacy is a recently proposed notion of privacy that provides
strong privacy guarantees without any assumptions on the adversary. The paper
studies the problem of computing a differentially private solution to convex
optimization problems whose objective function is piecewise affine. Such
problem is motivated by applications in which the affine functions that define
the objective function contain sensitive user information. We propose several
privacy preserving mechanisms and provide analysis on the trade-offs between
optimality and the level of privacy for these mechanisms. Numerical experiments
are also presented to evaluate their performance in practice
Simulation-based solution of stochastic mathematical programs with complementarity constraints: Sample-path analysis
We consider a class of stochastic mathematical programs with complementarity constraints, in which both the objective and the constraints involve limit functions or expectations that need to be estimated or approximated. Such programs can be used for modeling \\average" or steady-state behavior of complex stochastic systems. Recently, simulation-based methods have been successfully used for solving challenging stochastic optimization problems and equilibrium models. Here we broaden the applicability of so-called the sample-path method to include the solution of certain stochastic mathematical programs with equilibrium constraints. The convergence analysis of sample-path methods rely heavily on stability conditions. We first review necessary sensitivity results, then describe the method, and provide sufficient conditions for its almost-sure convergence. Alongside we provide a complementary sensitivity result for the corresponding deterministic problems. In addition, we also provide a unifying discussion on alternative set of sufficient conditions, derive a complementary result regarding the analysis of stochastic variational inequalities, and prove the equivalence of two different regularity conditions.simulation;mathematical programs with equilibrium constraints;stability;regularity conditions;sample-path methods;stochastic mathematical programs with complementarity constraints
- …