Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleAugust 2024
Stochastic Augmented Lagrangian Method in Riemannian Shape Manifolds
Journal of Optimization Theory and Applications (JOPT), Volume 203, Issue 1Pages 165–195https://doi.org/10.1007/s10957-024-02488-1AbstractIn this paper, we present a stochastic augmented Lagrangian approach on (possibly infinite-dimensional) Riemannian manifolds to solve stochastic optimization problems with a finite number of deterministic constraints. We investigate the ...
- rapid-communicationMay 2024
Distributed strategies for mixed equilibrium problems: Continuous-time theoretical approaches
Automatica (Journal of IFAC) (AJIF), Volume 161, Issue Chttps://doi.org/10.1016/j.automatica.2023.111501AbstractIn this paper, the mixed equilibrium problem is studied by employing a continuous-time multi-agent system, where the objective of agents is to cooperatively find a point from the feasible set such that the sum of bifunctions with a free-variable ...
- research-articleJanuary 2024
Distributed strategy for constrained resource allocation problems of autonomous second-order nonlinear agents and its application to smart grids
Information Sciences: an International Journal (ISCI), Volume 652, Issue Chttps://doi.org/10.1016/j.ins.2023.119754AbstractThis paper studies the constrained distributed resource allocation problems (DRAPs) of autonomous multi-agent systems (MASs). Unlike well-defined DRAPs, the disturbed second-order agents are taken into account. Moreover, all agents' decisions are ...
- ArticleAugust 2023
Nonholonomic Systems with Inequality Constraints
AbstractIn this paper we derive the equations of motion for nonholonomic systems subject to inequality constraints, both in continuous-time and discrete-time. The last is done by discretizing the continuous time-variational principle which defines the ...
-
- rapid-communicationOctober 2022
Distributed algorithm design for constrained resource allocation problems with high-order multi-agent systems
Automatica (Journal of IFAC) (AJIF), Volume 144, Issue Chttps://doi.org/10.1016/j.automatica.2022.110492AbstractThis paper studies distributed resource allocation problems of multi-agent systems, where the decisions of agents are subject to inequality network resource constraints and local inequality constraints. Compared with well-known ...
- research-articleAugust 2022
Proportion constrained weakly supervised histopathology image classification
Computers in Biology and Medicine (CBIM), Volume 147, Issue Chttps://doi.org/10.1016/j.compbiomed.2022.105714AbstractMultiple instance learning (MIL) deals with data grouped into bags of instances, of which only the global information is known. In recent years, this weakly supervised learning paradigm has become very popular in histological image analysis ...
Highlights- A novel constrained formulation for weakly supervised histology WSI classification.
- Using relative class proportions priors for prostate cancer instances grading.
- SICAP-MIL, a novel publicly available dataset of prostate WSIs for ...
- research-articleOctober 2021
A mixture varying-gain dynamic learning network for solving nonlinear and nonconvex constrained optimization problems
Neurocomputing (NEUROC), Volume 456, Issue CPages 232–242https://doi.org/10.1016/j.neucom.2021.05.037AbstractNonlinear and nonconvex optimization problem (NNOP) is a challenging problem in control theory and applications. In this paper, a novel mixture varying-gain dynamic learning network (MVG-DLN) is proposed to solve NNOP with inequality ...
- research-articleJune 2019
A further study on the inequality constraints in stochastic configuration networks
Information Sciences: an International Journal (ISCI), Volume 487, Issue CPages 77–83https://doi.org/10.1016/j.ins.2019.02.066AbstractStochastic Configuration Networks (SCNs) can be incrementally constructed by using supervisory mechanisms on the selection of random weights and biases. Due to its ease in implementation, fast training and less human intervention, SCNs ...
- research-articleSeptember 2017
Solving piecewise polynomial constraint systems with decomposition and a subdivision-based solver
Computer-Aided Design (CADE), Volume 90, Issue CPages 37–47https://doi.org/10.1016/j.cad.2017.05.023AbstractPiecewise polynomial constraint systems are common in numerous problems in computational geometry, such as constraint programming, modeling, and kinematics. We propose a framework that is capable of decomposing, and efficiently solving ...
Graphical abstractDisplay Omitted
Highlights- A framework for decomposing constraint systems, with a total DoF of zero or one.
- articleSeptember 2017
A new method for interpolating in a convex subset of a Hilbert space
Computational Optimization and Applications (COOP), Volume 68, Issue 1Pages 95–120https://doi.org/10.1007/s10589-017-9906-9In this paper, interpolating curve or surface with linear inequality constraints is considered as a general convex optimization problem in a Reproducing Kernel Hilbert Space. The aim of the present paper is to propose an approximation method in a very ...
- articleJune 2017
Global Optimality Conditions in Nonconvex Optimization
Journal of Optimization Theory and Applications (JOPT), Volume 173, Issue 3Pages 770–792https://doi.org/10.1007/s10957-016-0998-7In this paper, we address the nonconvex optimization problem, with the goal function and the inequality constraints given by the functions represented by the difference of convex functions. The effectiveness of the classical Lagrange function and the ...
- research-articleSeptember 2015
A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization
Applied Mathematics and Computation (APMC), Volume 266, Issue CPages 560–578https://doi.org/10.1016/j.amc.2015.05.091In this paper, a primal-dual quasi interior-point algorithm for inequality constrained optimization problems is presented. At each iteration, the algorithm solves only two or three reduced systems of linear equations with the same coefficient matrix. The ...
- research-articleApril 2015
A fully geometric approach for interactive constraint-based structural equilibrium design
Computer-Aided Design (CADE), Volume 61, Issue CPages 42–57https://doi.org/10.1016/j.cad.2014.04.001This paper introduces computational techniques to support architects and structural designers in the shaping of strut-and-tie networks in static equilibrium. Taking full advantage of geometry, these techniques build on the reciprocal diagrams of graphic ...
- articleSeptember 2014
Noise model based ν-support vector regression with its application to short-term wind speed forecasting
Support vector regression (SVR) techniques are aimed at discovering a linear or nonlinear structure hidden in sample data. Most existing regression techniques take the assumption that the error distribution is Gaussian. However, it was observed that the ...
- articleApril 2014
Bayesian test on equality of score parameters in the order restricted RC association model
Computational Statistics & Data Analysis (CSDA), Volume 72Pages 147–157https://doi.org/10.1016/j.csda.2013.11.009In the RC association model for a two-way contingency table, it is often natural to impose order constraints on the score parameters of the row and column variables. In this article, a simple and efficient Bayesian model selection procedure is proposed ...
- articleNovember 2013
Parameter Tuning of Multi-Proportional-Integral-Derivative Controllers Based on Optimal Switching Algorithms
Journal of Optimization Theory and Applications (JOPT), Volume 159, Issue 2Pages 454–472https://doi.org/10.1007/s10957-013-0306-8Under the framework of switched systems, this paper considers a multi-proportional-integral-derivative controller parameter tuning problem with terminal equality constraints and continuous-time inequality constraints. The switching time and controller ...
- articleJune 2013
Linear optimization with bipolar max-min constraints
Information Sciences: an International Journal (ISCI), Volume 234Pages 3–15https://doi.org/10.1016/j.ins.2011.06.009We consider a generalization of the linear optimization problem with fuzzy relational (in)equality constraints by allowing for bipolar max-min constraints, i.e. constraints in which not only the independent variables but also their negations occur. A ...
- articleDecember 2012
Bayesian inference through encompassing priors and importance sampling for a class of marginal models for categorical data
Computational Statistics & Data Analysis (CSDA), Volume 56, Issue 12Pages 4067–4080https://doi.org/10.1016/j.csda.2012.04.006A Bayesian approach is developed for selecting the model that is most supported by the data within a class of marginal models for categorical variables, which are formulated through equality and/or inequality constraints on generalized logits (local, ...