PLCP

swMATH4795MaRDI QIDQ16957FDOQ16957

Author name not available (Why is that?)

Described by source

• Numerical optimization. Theoretical and practical aspects. Transl. from the French

Cited In (only showing first 100 items - show all)

• Title not available (Why is that?)
• A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
• A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization
• Inverse problem for a class of nonlinear elliptic equations with entropy solution
• Large-scale unit commitment under uncertainty: an updated literature survey
• Outer-approximation algorithms for nonsmooth convex MINLP problems
• Optimizing parameters in clinical trials with a randomized start or withdrawal design
• Qualification Conditions in Semialgebraic Programming
• Micromorphic computational homogenization for mechanical metamaterials with patterning fluctuation fields
• Topology optimization design of stretchable metamaterials with Bézier skeleton explicit density (BSED) representation algorithm
• A novel high-order functional based image registration model with inequality constraint
• Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions
• Finding the optimal opening time of harvesting farmed fishery resources
• Semismooth SQP method for equality-constrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraints
• A comparison of four approaches from stochastic programming for large-scale unit-commitment
• A Nash game based variational model for joint image intensity correction and registration to deal with varying illumination
• A feasible point method with bundle modification for nonsmooth convex constrained optimization
• Constrained Consensus-Based Optimization
• A feasibility-ensured Lagrangian heuristic for general decomposable problems
• Optimisation of time-scheduled regimen for anti-cancer drug infusion
• A \(\mathcal{UV}\)-method for a class of constrained minimized problems of maximum eigenvalue functions
• A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration
• A Newton solver for micromorphic computational homogenization enabling multiscale buckling analysis of pattern-transforming metamaterials
• A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
• Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
• A three-term recurrence relation for accurate evaluation of transition probabilities of the simple birth-and-death process
• A unified framework for high-order numerical discretizations of variational inequalities
• Risk-averse stochastic programming and distributionally robust optimization via operator splitting
• Heat and electricity market coordination: a scalable complementarity approach
• A proximal-projection partial bundle method for convex constrained minimax problems
• Multi-phase algorithm design for accurate and efficient model fitting
• A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming
• Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study
• On the stabilization of singular identification problem of an unknown discontinuous diffusion parameter in elliptic equation
• Dual norm based iterative methods for image restoration
• Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
• Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers
• Allee optimal control of a system in ecology
• Physics constrained learning for data-driven inverse modeling from sparse observations
• Fully smoothed \(\ell_1\)-\(TV\) models: bounds for the minimizers and parameter choice
• A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization
• A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements
• Superlinear convergence of the sequential quadratic method in constrained optimization
• Global optimality conditions and exact penalization
• A Vectorized Regularization Method for Multivalued Parameters Identification
• Some new facts about sequential quadratic programming methods employing second derivatives
• A proof of convergence of the concave-convex procedure using Zangwill's theory
• Global optimality conditions in nonconvex optimization
• Global optimal power flow over large-scale power transmission networks
• A Computational Algorithm for Equilibrium Asset Pricing Under Heterogeneous Information and Short-Sale Constraints
• Global optimization for optimal power flow over transmission networks
• Rate of convergence of the bundle method
• Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems
• The Homogenization Method for Topology Optimization of Structures: Old and New
• Refining the partition for multifold conic optimization problems
• Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
• Approximate Cayley transform methods for inverse eigenvalue problems and convergence analysis
• A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach
• A posteriori estimates distinguishing the error components and adaptive stopping criteria for numerical approximations of parabolic variational inequalities
• Conjugate gradient-type algorithms for frictional multi-contact problems: applications to granular materials
• Optimization of real asset portfolio using a coherent risk measure: Application to oil and energy industries
• The hybrid proximal decomposition method applied to the computation of a Nash equilibrium for hydrothermal electricity markets
• A discussion of probability functions and constraints from a variational perspective
• Robust static super-replication of barrier options
• Global convergence of quasi-Newton methods based on adjoint Broyden updates
• Reliability-based optimization of maintenance scheduling of mechanical components under fatigue
• On the Sequential Quadratically Constrained Quadratic Programming Methods
• A class of Benders decomposition methods for variational inequalities
• Sufficient dimension reduction using Hilbert-Schmidt independence criterion
• Interactive model-based search for global optimization
• Modelling and parameter identification for a nonlinear time-delay system in microbial batch fermentation
• A method for constrained multiobjective optimization based on SQP techniques
• A Class of Inexact Variable Metric Proximal Point Algorithms
• Optimization with Multivariate Stochastic Dominance Constraints
• On the local convergence analysis of the gradient sampling method for finite max-functions
• Local convergence of filter methods for equality constrained non-linear programming
• A fast gradient and function sampling method for finite-max functions
• A modified hybrid genetic algorithm for solving nonlinear optimal control problems
• Strong Convergence of an Inexact Proximal Point Algorithm for Equilibrium Problems in Banach Spaces
• Global optimization of multilevel electricity market models including network design and graph partitioning
• A continuum three-zone model for swarms
• Hessian-based anisotropic mesh adaptation in domains with discrete boundaries
• An ODE traffic network model
• HLRF-BFGS optimization algorithm for structural reliability
• Solving inverse problems involving the Navier--Stokes equations discretized by a Lagrange--Galerkin method
• Proximal bundle methods for nonsmooth DC programming
• Computing proximal points of convex functions with inexact subgradients
• Adjoint method for an inverse problem of CCPF model
• Revealing network communities with a nonlinear programming method
• Exact histogram specification for digital images using a variational approach
• Bundle relaxation and primal recovery in unit commitment problems. The Brazilian case
• A note on convergence analysis of an SQP-type method for nonlinear semidefinite programming
• Error Estimates for the Euler Discretization of an Optimal Control Problem with First-Order State Constraints
• Dynamic bundle methods
• Numerical optimization. Theoretical and practice aspects
• Perron vector optimization applied to search engines
• On optimal control of a sweeping process coupled with an ordinary differential equation
• Fast calculation of multiobjective probability of improvement and expected improvement criteria for Pareto optimization
• A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
• Properties of an augmented Lagrangian for design optimization

This page was built for software: PLCP